sign in
english version rss feed

inria-00287867, version 1

On the Parallelization of Monte-Carlo planning

Sylvain Gelly 12, Jean-Baptiste Hoock 3, Arpad Rimmel 3, Olivier Teytaud () 12, Yann 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.

  • Domain : Mathematics/Optimization and Control
  • Keywords : Parallelization – Monte-Carlo Planning – Bandits
 
  • inria-00287867, version 1
  • oai:hal.inria.fr:inria-00287867
  • From: 
  • Submitted on: Friday, 13 June 2008 10:56:44
  • Updated on: Friday, 13 June 2008 11:39:12
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...