Skip to Main content Skip to Navigation
Conference papers

Adding expert knowledge and exploration in Monte-Carlo Tree Search

Guillaume Chaslot 1 Christophe Fiter 2 Jean-Baptiste Hoock 2 Arpad Rimmel 2 Olivier Teytaud 2, 3, 4
2 TAO - Machine Learning and Optimisation
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LRI - Laboratoire de Recherche en Informatique
3 TANC - Algorithmic number theory for cryptology
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : We present a new exploration term, more efficient than clas- sical UCT-like exploration terms and combining efficiently expert rules, patterns extracted from datasets, All-Moves-As-First values and classi- cal online values. As this improved bandit formula does not solve several important situations (semeais, nakade) in computer Go, we present three other important improvements which are central in the recent progress of our program MoGo: { We show an expert-based improvement of Monte-Carlo simulations for nakade situations; we also emphasize some limitations of this modification. { We show a technique which preserves diversity in the Monte-Carlo simulation, which greatly improves the results in 19x19. { Whereas the UCB-based exploration term is not efficient in MoGo, we show a new exploration term which is highly efficient in MoGo. MoGo recently won a game with handicap 7 against a 9Dan Pro player, Zhou JunXun, winner of the LG Cup 2007, and a game with handicap 6 against a 1Dan pro player, Li-Chen Chien.
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/inria-00386477
Contributor : Olivier Teytaud <>
Submitted on : Thursday, May 21, 2009 - 10:29:55 PM
Last modification on : Thursday, July 8, 2021 - 3:47:47 AM
Long-term archiving on: : Monday, October 15, 2012 - 10:51:28 AM

File

peacg.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00386477, version 1

Collections

Citation

Guillaume Chaslot, Christophe Fiter, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud. Adding expert knowledge and exploration in Monte-Carlo Tree Search. Advances in Computer Games, 2009, Pamplona, Spain. ⟨inria-00386477⟩

Share

Metrics

Record views

695

Files downloads

1347