Combining UCT and Nested Monte Carlo Search for Single-Player General Game Playing

Monte-Carlo tree search has recently been very successful for game playing particularly for games where the evaluation of a state is difficult to compute, such as Go or General Games. We compare Nested Monte-Carlo Search (NMC), Upper Confidence bounds for Trees (UCT-T), UCT with transposition tables (UCT+T) and a simple combination of NMC and UCT+T (MAX) on single-player games of the past GGP competitions. We show that transposition tables improve UCT and that MAX is the best of these four algorithms. Using UCT+T, the program Ary won the 2009 GGP competition. MAX and NMC are slight improvements over this 2009 version.

• Type: Journal
• Year: 2010
• Where: TCIAIG
• Authors: Jean Méhat, Tristan Cazenave
• Keywords: Ggp Competition, Monte-Carlo Tree Search, Software Engineering, TCIAIG 2010, Transposition Tables