Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search

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

Abstract

Monte Carlo Tree Search is a recent algorithm that achieves more and more successes in various domains. We propose an improvement of the Monte Carlo part of the algorithm by modifying the simulations depending on the context. The modification is based on a reward function learned on a tiling of the space of Monte Carlo simulations. The tiling is done by regrouping the Monte Carlo simulations where two moves have been selected by one player. We show that it is very efficient by experimenting on the game of Havannah.
Fichier principal
Vignette du fichier
CMC.pdf (216.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00456422 , version 1 (15-02-2010)
inria-00456422 , version 2 (16-03-2011)

Identifiers

  • HAL Id : inria-00456422 , version 2

Cite

Arpad Rimmel, Fabien Teytaud. Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search. Evostar, Apr 2010, Istanbul, Turkey. ⟨inria-00456422v2⟩
200 View
490 Download

Share

Gmail Facebook Twitter LinkedIn More