
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
A simple tutorial on MonteCarlo Tree Search
Contains a description of dynamic programming and alphabeta search, then MCTS. Special cases for simultaneous actions are discussed.
I should add comments so that it can be used without preliminary knowledge of MCTS, if there is at least one request for doing so I'll do it.
@article{gelly:hal00695370,
hal_id = {hal00695370},
url = {http://hal.inria.fr/hal00695370},
title = {{The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions}},
author = {Gelly, Sylvain and Kocsis, Levente and Schoenauer, Marc and Sebag, Mich{\`e}le and Silver, David and Szepesvari, Csaba and Teytaud, Olivier},
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 MonteCarlo meth ods. Programs based on MonteCarlo tree search now play at humanmaster levels and are beginning to challenge top professional players. In this paper we describe the leading algorithms for MonteCarlo tree search and explain how they have advanced the state of the art in computer Go.}},
language = {Anglais},
affiliation = {TAO  INRIA Saclay  Ile de France , Laboratoire de Recherche en Informatique  LRI , LPDS , Microsoft Research  Inria Joint Centre  MSR  INRIA , University of Alberta, Canada , Department of Computing Science},
publisher = {ACM},
pages = {106113},
journal = {Communication of the ACM},
volume = {55},
number = {3 },
audience = {internationale },
year = {2012},
pdf = {http://hal.inria.fr/hal00695370/PDF/CACMMCTS.pdf},
}
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment