期刊
COMMUNICATIONS OF THE ACM
卷 55, 期 3, 页码 106-113出版社
ASSOC COMPUTING MACHINERY
DOI: 10.1145/2093548.2093574
关键词
-
类别
资金
- AICML
- AITF
- NSERC
- PASCAL2 Network of Excellence [216886]
- PASCAL Network of Excellence [IST 2002-506778]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据