On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms

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

Abstract

Monte-Carlo Tree Search (MCTS) algorithms, including upper confidence Bounds (UCT), have very good results in the most difficult board games, in particular the game of Go. More recently these methods have been successfully introduce in the games of Hex and Havannah. In this paper we will define decisive and anti-decisive moves and show their low computational overhead and high efficiency in MCTS.
Fichier principal
Vignette du fichier
cig2010.pdf (848.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00495078 , version 1 (25-06-2010)

Identifiers

  • HAL Id : inria-00495078 , version 1

Cite

Fabien Teytaud, Olivier Teytaud. On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms. IEEE Conference on Computational Intelligence and Games, Aug 2010, Copenhagen, Denmark. ⟨inria-00495078⟩
364 View
692 Download

Share

Gmail Facebook Twitter LinkedIn More