The Research of Searching Algorithm in Amazons Game
In the area of computer game, Amazons game is a relatively new one whose rules stand between the game of Chess and Go. Its move rule is simple but apt to generate tremendous move branches. Based on the UCT searching algorithm, this paper presents an idea that the whole process of Amazons game can be divided into three phases, which are the Opening, Middle game and Endgame, then different strategies are applied to different phases according to their respective characteristics. Furthermore, a new Monte-Carlo simulation method applicable to Amazons game is proposed in this paper. The corresponding experiments are conducted to show the validation of the proposed algorithms.
Amazons game UCT Monte-Carlo simulation Searching Algorithm
Qinqin Guo ShuQin Li Hua Bao
Beijing Information Science & Technology University
国际会议
2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)
四川绵阳
英文
1859-1862
2011-05-23（万方平台首次上网日期，不代表论文的发表时间）