A Study of UCT and Its Enhancements in an Artificial Game

Abstract. Monte-Carlo tree search, especially the UCT algorithm and its enhancements, have become extremely popular. Because of the importance of this family of algorithms, a deeper understanding of when and how the different enhancements work is desirable. To avoid the hard to analyze intricacies of tournamentograms in complex games, this work focuses on a simple abstract game, which is designed to be ideal for history-based heuristics such as RAVE. Experiments show the influence of game complexity and of enhancements on the performance of Monte-Carlo Tree Search.

• Type: Conference
• Year: 2009
• Where: ACG
• Authors: David Tom, Martin Müller
• Keywords: ACG 2009, Computer Graphics, Monte-Carlo Tree Search, Simple Abstract Game, UCT Algorithm