HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search

Rémi Coulom 1
1 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
Abstract : Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-max tree. This paper presents a new framework to combine tree search with Monte-Carlo evaluation, that does not separate between a min-max phase and a Monte-Carlo phase. Instead of backing-up the min-max value close to the root, and the average value at some depth, a more general backup operator is defined that progressively changes from averaging to min-max as the number of simulations grows. This approach provides a fine-grained control of the tree growth, at the level of individual simulations, and allows efficient selectivity methods. This algorithm was implemented in a Go-playing program, Crazy Stone, that won the gold medal of the $9 \times 9$ Go tournament at the 11th Computer Olympiad.
Document type :
Conference papers
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download

Contributor : Rémi Coulom Connect in order to contact the contributor
Submitted on : Wednesday, November 29, 2006 - 12:12:56 PM
Last modification on : Thursday, January 20, 2022 - 4:16:22 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 11:37:51 PM


Publisher files allowed on an open archive


  • HAL Id : inria-00116992, version 1



Rémi Coulom. Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. 5th International Conference on Computer and Games, May 2006, Turin, Italy. ⟨inria-00116992⟩



Record views


Files downloads