Creating an Upper-Confidence-Tree program for Havannah - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Creating an Upper-Confidence-Tree program for Havannah

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

Abstract

Monte-Carlo Tree Search and Upper Confidence Bounds pro- vided huge improvements in computer-Go. In this paper, we test the generality of the approach by experimenting on another game, Havannah, which is known for being especially difficult for computers. We show that the same results hold, with slight differences related to the absence of clearly known patterns for the game of Havannah, in spite of the fact that Havannah is more related to connection games like Hex than to territory games like Go.
Fichier principal
Vignette du fichier
hav.pdf (1.22 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00380539 , version 1 (02-05-2009)

Identifiers

  • HAL Id : inria-00380539 , version 1

Cite

Fabien Teytaud, Olivier Teytaud. Creating an Upper-Confidence-Tree program for Havannah. ACG 12, May 2009, Pamplona, Spain. ⟨inria-00380539⟩
318 View
551 Download

Share

Gmail Facebook Twitter LinkedIn More