Open AccessDesign and Application of Tibetan Long Chess Using Monte Carlo Algorithm and Artificial Intelligence
Author(s) -
Junjie Zhou
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1952/4/042104
Subject(s) - monte carlo method , computer chess , computer science , algorithm , look ahead , variety (cybernetics) , monte carlo algorithm , artificial intelligence , core (optical fiber) , mathematics , statistics , telecommunications , championship , archaeology , history
In order to study the algorithm of Tibetan Jiuqi, a new kind of chess in Chinese computer game, there are too many possibilities to be considered in solving the problems of falling pieces, and the influence of falling pieces on Xingzi and Tiezi. On the basis of forming different chess patterns as the main source of raising pieces, this paper puts forward a design scheme which takes the Monte Carlo algorithm randomly as the core and the final evaluation algorithm as the secondary one, and takes a variety of possibilities in Tibetan chess as a breakthrough. Get different benefits from different chess types to cooperate with the final evaluation algorithm to get the assignment of each replicated chessboard. It is proved by the program computer game that the program is complete and the three stages of Tibetan chess can be completed successfully. The experiment shows that the Monte Carlo algorithm is very suitable for the AI development of Tibetan chess.