Accelerated UCT and Its Application to Two-Player Games
Accelerated UCT and Its Application to Two-Player Games
复制标题
加速UCT及其在两人游戏中的应用
DOI：
10.1007/978-3-642-31866-5_1
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
Kazuki Yoshizoe and Kokolo Ikeda
中科院分区：
文献类型：
--
作者：
Junichi Hashimoto;Akihiro Kishimoto;Kazuki Yoshizoe and Kokolo Ikeda
蒙特卡罗树搜索(MCTS)是提高游戏程序性能的一种成功方法。本文提出了一种加速的UCT算法，克服了MCTS算法在博弈树搜索中经常出现的欺骗性结构的弱点。它包括使用新的备份操作符，该操作符为最近访问的操作分配较高的权重，而为很长时间未访问的操作分配较低的权重。在奥赛罗、哈凡纳和围棋上的实验结果表明，加速UCT不仅比以前的方法更有效，而且还提高了最好的计算机围棋程序之一Fuego的实力。
Monte-Carlo Tree Search (MCTS) is a successful approach for improving the performance of game-playing programs. This paper presents the Accelerated UCT algorithm, which overcomes a weakness of MCTS caused by deceptive structures which often appear in game tree search. It consists in using a new backup operator that assigns higher weights to recently visited actions, and lower weights to actions that have not been visited for a long time. Results in Othello, Havannah, and Go show that Accelerated UCT is not only more effective than previous approaches but also improves the strength of Fuego, which is one of the best computer Go programs.