Abstract: First, this paper introduces the rules of the game NoGo. Next, we review current methods of artificial intelligence and their respective shortcomings. Then, the article shows an analysis of the game theory characteristics of NoGo and proposes a value evaluation function. Based on this function, a multi-layer recursive algorithm to the artificial intelligence of NoGo can be constructed, which addresses the problem of high complexity in time and space in the present algorithm. Finally, the paper demonstrates the capability of this algorithm and provides results that the program against with the famous open source software OASE-NoGo, which achieved a winning rate of more than 90%. In a typical situation, it demonstrates that the algorithm is better than existing algorithms in computing, and proves the feasibility and effectiveness of this method.

Key words: artificial intelligence, machine game, NoGo, value evaluation, recursion