Sciweavers

Share
ICGA
2008

Cross-Entropy for Monte-Carlo Tree Search

8 years 2 months ago
Cross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs. To improve the playing strength of these Go programs any further, many parameters dealing with MCTS should be fine-tuned. In this paper, we propose to apply the Cross-Entropy Method (CEM) for this task. The method is comparable to Estimation-of-Distribution Algorithms (EDAs), a new area of evolutionary computation. We tested CEM by tuning various types of parameters in our Go program MANGO. The experiments were performed in matches against the open-source program GNU GO. They revealed that a program with the CEM-tuned parameters played better than without. Moreover, MANGO plus CEM outperformed the regular MANGO for various time settings and board sizes. From the results we may conclude that parameter tuning by CEM genuinely improved the playing strength of MANGO, for various time settings. This result may be...
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where ICGA
Authors Guillaume Chaslot, Mark H. M. Winands, Istvan Szita, H. Jaap van den Herik
Comments (0)
books