Monte-Carlo Tree Search in Crazy Stone

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 tree search has recently revolutionized Go programming. Even on the large 19x19 board, the strongest Monte-Carlo programs are now stronger than the strongest classical programs. This talk is a summary of the principle of Monte-Carlo tree search, and a description of Crazy Stone, one of those new artificial players.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00177155
Contributor : Rémi Coulom <>
Submitted on : Tuesday, December 18, 2007 - 10:58:34 AM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM

Identifiers

  • HAL Id : inria-00177155, version 1

Collections

Citation

Rémi Coulom. Monte-Carlo Tree Search in Crazy Stone. 12th Game Programming Workshop, Nov 2007, Hakone, Japan. ⟨inria-00177155⟩

Share

Metrics

Record views

224