Pattern matching and Monte-Carlo simulation mechanism for the game of NoGo

The game of NoGo is similar to Go, that means they have similar chessboard and stones. However, the rulers are completely different. If the first player suicides, kills a group, or has no more legal moves, the opponent will win the game. In this paper, the patterns of NoGo are given to both players, Black and White, and the urgency of a pattern is represented by its value. At the same time, an improved pattern matching algorithm is put forward to find out the best move for the game of NoGo. In addition, if the best move has not been found by matching pattern, an optimized Monte-Carlo simulation mechanism is also applied to play the game of NoGo. The experimental results show that the proposed approaches are workable for NoGo.