The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions

Abstract : The ancient oriental game of Go has long been considered a grand challenge for artificial intelligence. For decades, com- puter Go has defied the classical methods in game tree search that worked so successfully for chess and checkers. How- ever, recent play in computer Go has been transformed by a new paradigm for tree search based on Monte-Carlo meth- ods. Programs based on Monte-Carlo tree search now play at human-master levels and are beginning to challenge top professional players. In this paper we describe the leading algorithms for Monte-Carlo tree search and explain how they have advanced the state of the art in computer Go.
Type de document :
Article dans une revue
Communications- ACM, Association for Computing Machinery, 2012, 55 (3), pp.106-113
Liste complète des métadonnées

Littérature citée [43 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00695370
Contributeur : Olivier Teytaud <>
Soumis le : mardi 19 février 2013 - 16:37:44
Dernière modification le : jeudi 5 avril 2018 - 12:30:12
Document(s) archivé(s) le : dimanche 2 avril 2017 - 02:44:24

Fichier

CACM-MCTS.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00695370, version 3

Collections

Citation

Sylvain Gelly, Marc Schoenauer, Michèle Sebag, Olivier Teytaud, Levente Kocsis, et al.. The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions. Communications- ACM, Association for Computing Machinery, 2012, 55 (3), pp.106-113. 〈hal-00695370v3〉

Partager

Métriques

Consultations de la notice

779

Téléchargements de fichiers

1222