Biasing Monte-Carlo Simulations through RAVE Values - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Biasing Monte-Carlo Simulations through RAVE Values

(1) , (2, 3) , (2, 3)
1
2
3

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.
Fichier principal
Vignette du fichier
poolrave.pdf (220.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00485555 , version 1 (21-05-2010)

Identifiers

  • HAL Id : inria-00485555 , version 1

Cite

Arpad Rimmel, Fabien Teytaud, Olivier Teytaud. Biasing Monte-Carlo Simulations through RAVE Values. The International Conference on Computers and Games 2010, Sep 2010, Kanazawa, Japan. ⟨inria-00485555⟩
311 View
1624 Download

Share

Gmail Facebook Twitter LinkedIn More