Accelerated UCT and its application to two-player games

Junichi Hashimoto, Akihiro Kishimoto, Kazuki Yoshizoe, Kokolo Ikeda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationAdvances in Computer Games - 13th International Conference, ACG 2011, Revised Selected Papers
Number of pages12
Publication statusPublished - 2012
Externally publishedYes
Event13th International Conference on Advances in Computer Games, ACG 2011 - Tilburg, Netherlands
Duration: Nov 20 2011Nov 22 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7168 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference13th International Conference on Advances in Computer Games, ACG 2011

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Accelerated UCT and its application to two-player games'. Together they form a unique fingerprint.

Cite this