Creating an Upper-Confidence-Tree program for Havannah

Fabien Teytaud (1, 2, 3) , Olivier Teytaud (1, 2, 3)

1 TANC - Algorithmic number theory for cryptology
2 LRI - Laboratoire de Recherche en Informatique
3 TAO - Machine Learning and Optimisation

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.

Domaines: Apprentissage [cs.LG]

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