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.
Type de document :
Communication dans un congrès
Takeshi Ito and Akihiro Kishimoto. 12th Game Programming Workshop, Nov 2007, Hakone, Japan. 2007
Liste complète des métadonnées

https://hal.inria.fr/inria-00177155
Contributeur : Rémi Coulom <>
Soumis le : mardi 18 décembre 2007 - 10:58:34
Dernière modification le : jeudi 11 janvier 2018 - 06:22:13

Identifiants

  • HAL Id : inria-00177155, version 1

Collections

Citation

Rémi Coulom. Monte-Carlo Tree Search in Crazy Stone. Takeshi Ito and Akihiro Kishimoto. 12th Game Programming Workshop, Nov 2007, Hakone, Japan. 2007. 〈inria-00177155〉

Partager

Métriques

Consultations de la notice

204