The research on patterns and UCT algorithm in NoGo game

NoGo game is similar to Go game, that means they have similar notion of group, killing, stones and chessboard. However, their rulers are completely different, or opposite, like 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 expounded in detail. The pattern values, the pattern sizes and the pattern formats are discussed. At the same time, an optimizing pattern matching algorithm is put forward to find out the best move for NoGo game. In addition, if the best move has not been found by the matching pattern algorithm, a modified UCT algorithm is also applied to play the NoGo game. The experimental results show that the proposed approaches are workable for NoGo.