Optimization and Comparison of Multiple Game Algorithms in Amazon Chess

Amazon Chess is a research project in the field of machine games. The first step is more than 2,000 moves. Because of its complicated start, it is very suitable for studying the algorithm related to machine game. This article is in the Amazon Chess environment to study the Minimax algorithm, Alpha-Beta algorithm and its optimization, PVS and MTD (f) algorithm, and the experiment comparing the advantages and disadvantages of various algorithms in efficiency. Experiments show that the use of historical heuristic and transposition table technology can greatly improve the search efficiency, and among the above algorithms, MTD(f) algorithm has the highest efficiency, and its search time and number of nodes are lower than other algorithms.