Abstract
Computer Games are an important aspect of Artificial Intelligence (AI) which has produced many representative algorithms of optimal strategies. Therefore, many AI researchers have applied game theory to various board games in an attempt to find the essence of games and grasp the core of AI behaviour. AlphaGo is a very famous and typical chess-playing program that uses Monte Carlo tree search (MCTS) to estimate the value of each node in the search tree and optimize the possible results. Chinese chess is one of the traditional chess versions with its typical strategy. However, due to its late start and high complexity, there are many more technical problems to be solved. In this paper, we recommend two commonly used search frameworks for Chinese chess: the minimax algorithm and the alpha-beta pruning algorithm. On this basis, to deal with the complex and changeable situation, the Chinese chess algorithm based on Monte Carlo tree search and appropriate neural network evaluation function is studied.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
