Journal
COMMUNICATIONS OF THE ACM
Volume 55, Issue 3, Pages 106-113Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/2093548.2093574
Keywords
-
Categories
Funding
- AICML
- AITF
- NSERC
- PASCAL2 Network of Excellence [216886]
- PASCAL Network of Excellence [IST 2002-506778]
Ask authors/readers for more resources
The ancient oriental game of Go has long been considered a grand challenge for artificial intelligence. For decades, computer Go has defied the classical methods in game tree search that worked so successfully for chess and checkers. However, recent play in computer Go has been transformed by a new paradigm for tree search based on Monte-Carlo methods. 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available