Move generation and search strategy research for computer game of checkers

Focusing on the computer game of checkers, this paper is aimed at exploring a proper way to find the optimum move in chess, in which a big effort was made in the part of move generation and search strategy research. The program of checkers tried to build a stable and intact generator of moves, and then designed a high-efficiency search engine, which based on the Minimax Search Tree. With a fixed search depth and a proper evaluation function, the chess strength is improved significantly. Experiments are conducted to prove the validity and feasibility of the algorithm.