Biasing Monte-Carlo Simulations through RAVE Values

Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, we propose a generic way of improving the Monte-Carlo simulations by using RAVE values, which already strongly improved the tree part of the algorithm. We prove the generality and efficiency of our approach by showing improvements on two different applications: the game of Havannah and the game of Go.

• Type: Journal
• Year: 2010
• Where: CG
• Authors: Arpad Rimmel, Fabien Teytaud, Olivier Teytaud
• Keywords: CG 2010, Computer Graphics, Monte-Carlo, Monte-Carlo Simulations, Monte-Carlo Tree Search