期刊
NEW MATHEMATICS AND NATURAL COMPUTATION
卷 4, 期 3, 页码 343-357出版社
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S1793005708001094
关键词
Monte-Carlo Tree Search; heuristic search; Computer Go
资金
- Dutch Organization for Scientific Research (NWO) [612.066.409]
Monte-Carlo Tree Search (MCTS) is a new best-first search guided by the results of Monte-Carlo simulations. In this article, we introduce two progressive strategies for MCTS, called progressive bias and progressive unpruning. They enable the use of relatively time-expensive heuristic knowledge without speed reduction. Progressive bias directs the search according to heuristic knowledge. Progressive unpruning first reduces the branching factor, and then increases it gradually again. Experiments assess that the two progressive strategies significantly improve the level of our Go program Mango. Moreover, we see that the combination of both strategies performs even better on larger board sizes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据