A Grid-Based Game Tree Evaluation System

Game tree search remains an interesting subject in artificial intelligence, and has been applied to many board games, including chess, Chinese chess, and GO. Given the exponential nature of the growth of tree size, a naive search of all the possible moves in the game tree (i.e. the min-max algorithm) is time consuming, and the search level, as well as the strength of the program, will be severely limited. Pruning the unnecessary part of the game tree (game tree pruning) is an important issue in increasing search efficiency. In this paper, we propose..