Man-machine chess game design based on minimum maximum algorithm

The interesting man-machine game tests people's intelligence and the computing power of machines, making the ancient game of chess more dynamic and becoming the key field of modern artificial intelligence research. In this paper, the minimum value maximum algorithm is used to realize the search algorithm of man-machine game. In the process of human and computer chess, the computer will choose the move method that makes its own situation score the highest, and the human will choose the move method that makes the computer situation score the lowest, which is the basis of the design of the minimum value maximum algorithm. The min Max algorithm also depends on how well the evaluation function is designed. On the basis of the minimum maximum algorithm, the pruning algorithm is further optimized, which can reduce the size of the search tree, optimize the search efficiency, and reduce the chess move time of the computer. After the chess game program is completed, man-machine chess can be realized. The human moves first, and the computer chooses the position of the drop according to the data returned by the algorithm and then chooses the most suitable move to achieve the effect of man-machine chess.