Journal
NEW MATHEMATICS AND NATURAL COMPUTATION
Volume 4, Issue 3, Pages 343-357Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S1793005708001094
Keywords
Monte-Carlo Tree Search; heuristic search; Computer Go
Categories
Funding
- Dutch Organization for Scientific Research (NWO) [612.066.409]
Ask authors/readers for more resources
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.
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