Pruning playouts in Monte-Carlo Tree Search for the game of Havannah - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Pruning playouts in Monte-Carlo Tree Search for the game of Havannah

Résumé

Monte-Carlo Tree Search (MCTS) is a popular technique for playing multi-player games. In this paper, we propose a new method to bias the playout policy of MCTS. The idea is to prune the decisions which seem " bad " (according to the previous iterations of the algorithm) before computing each playout. Thus, the method evaluates the estimated " good " moves more precisely. We have tested our improvement for the game of Havannah and compared it to several classic improvements. Our method outperforms the classic version of MCTS (with the RAVE improvement) and the different playout policies of MCTS that we have experimented.
Fichier principal
Vignette du fichier
Dugueperoux_CG2016.pdf (689.94 Ko) Télécharger le fichier
Dugueperoux_CG2016_slides.pdf (614.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01342347 , version 1 (05-07-2016)

Identifiants

  • HAL Id : hal-01342347 , version 1

Citer

Joris Duguépéroux, Ahmad Mazyad, Fabien Teytaud, Julien Dehos. Pruning playouts in Monte-Carlo Tree Search for the game of Havannah. The 9th International Conference on Computers and Games (CG2016), Jun 2016, Leiden, Netherlands. ⟨hal-01342347⟩
178 Consultations
2144 Téléchargements

Partager

Gmail Facebook X LinkedIn More