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.