inria-00287867, version 1
On the Parallelization of Monte-Carlo planning
Sylvain Gelly 1, 2Jean-Baptiste Hoock 3Arpad Rimmel 3Olivier Teytaud
1, 2Yann Kalemkarian 4
ICINCO (2008)
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.
- 1: TAO (INRIA Futurs)
- INRIA – CNRS : UMR8623 – Université Paris XI - Paris Sud
- 2: Laboratoire de Recherche en Informatique (LRI)
- CNRS : UMR8623 – Université Paris XI - Paris Sud
- 3: TAO (INRIA Saclay - Ile de France)
- INRIA – CNRS : UMR8623 – Université Paris XI - Paris Sud
- 4: Bull SAS (Bull)
- Bull SAS
- Domain : Mathematics/Optimization and Control
- Keywords : Parallelization – Monte-Carlo Planning – Bandits
- inria-00287867, version 1
- http://hal.inria.fr/inria-00287867
- oai:hal.inria.fr:inria-00287867
- From: Olivier Teytaud
- Submitted on: Friday, 13 June 2008 10:56:44
- Updated on: Friday, 13 June 2008 11:39:12






Associated documents
Export