PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
GUILLAUME M. J-B. CHASLOT, MARK H. M. WINANDS, H. JAAP VAN DEN HERIK, JOS W. H. M. UITERWIJK, BRUNO BOUZY
Source record
Source: Crossref
Published: Nov 1, 2008
DOI: 10.1142/s1793005708001094
Open original source ↗Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.