Skip to Main content Skip to Navigation
Conference papers

On the Parallelization of Monte-Carlo planning

Sylvain Gelly 1, 2 Jean-Baptiste Hoock 3 Arpad Rimmel 3 Olivier Teytaud 1, 2 Yann Kalemkarian 4
1 TANC - Algorithmic number theory for cryptology
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
3 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
Abstract : We provide a parallelization with and without shared-memory for Bandit-Based Monte-Carlo Planning algorithms, applied to the game of Go. The resulting algorithm won the first non-blitz game against a professionnal human player in 9x9 Go.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Olivier Teytaud Connect in order to contact the contributor
Submitted on : Friday, June 13, 2008 - 10:56:44 AM
Last modification on : Thursday, July 8, 2021 - 3:48:46 AM
Long-term archiving on: : Friday, May 28, 2010 - 10:19:42 PM


Files produced by the author(s)


  • HAL Id : inria-00287867, version 1


Sylvain Gelly, Jean-Baptiste Hoock, Arpad Rimmel, Olivier Teytaud, Yann Kalemkarian. On the Parallelization of Monte-Carlo planning. ICINCO, May 2008, Madeira, Portugal. ⟨inria-00287867⟩



Record views


Files downloads