UCT Algorithm in Amazons Human-computer Games
The main difficulty of Amazons games is the huge branch factor.Traditional NegaMax Search and Alpha-Beta Search can only search a few layers and cant improve the games effectively.Monte-Carlo Algorithm can improve the games but it needs a huge amount of computing.This paper studies applying UCT algorithm to the Amazons games to overcome this problem in order to balance the search efficiency and computing load.In UCT mini-max tree search,the algorithm select tree node according to the nodes UCB(Upper Confidence Bound)value.Then evaluate the selected node and return the optimal moves.Using C++programming language,we implemented Amazons human-computer games software.The experiments show that UCT algorithm can implement the search work in Amazons human-computer games and get satisfactory search efficiency.
Artificial Intelligence Computer Games Amazons UCT Algorithm Monte-Carlo
Xiali Li Liang Hou Licheng Wu
School of Information Engineering,MINZU University of China,Beijing 100081
国际会议
长沙
英文
3358-3361
2014-05-31（万方平台首次上网日期，不代表论文的发表时间）