著者

Hashimoto Junichi Kishimoto Akihiro Yoshizoe Kazuki Ikeda Kokolo

出版者

Springer

雑誌

Lecture Notes in Computer Science (ISSN:03029743)

巻号頁・発行日

vol.7168, pp.1-12, 2012

被引用文献数

6

---

Monte-Carlo Tree Search (MCTS) is a very 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.