The Research of Searching Algorithm in Amazons Game
会议名称：《2011 Chinese Control and Decision Conference（CCDC）》
会议日期：2011年
学科分类：081203[工学-计算机应用技术] 08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）]
基 金：sponsored by the Funding Project for Academic Human Resources Development in Institutions of Higher Learning under the Jurisdiction of Beijing Municipality (PHR201007131) by Scientific Research Common Program of Beijing Municipal Commission of Education (KM200910772011) by School Graduate Technology Innovation Project (1006Y1874-1) by School Research Fund (1025013)
关 键 词：Amazons game UCT Monte-Carlo simulation Searching Algorithm
摘 要：In the area of computer game,Amazons game is a relatively new one whose rules stand between the game of Chess and *** move rule is simple but apt to generate tremendous move *** 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 ***,a new Monte-Carlo simulation method applicable to Amazons game is proposed in this *** corresponding experiments are conducted to show the validation of the proposed algorithms.