inria-00380539, version 1
Creating an Upper-Confidence-Tree program for Havannah
Fabien Teytaud
1, 2, 3Olivier Teytaud 1, 2, 3
ACG 12 (2009)
Résumé : 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.
- 1 : TAO (INRIA Futurs)
- INRIA – CNRS : UMR8623 – Université Paris XI - Paris Sud
- 2 : Laboratoire de Recherche en Informatique (LRI)
- CNRS : UMR8623 – Université Paris XI - Paris Sud
- 3 : TAO (INRIA Saclay - Ile de France)
- INRIA – CNRS : UMR8623 – Université Paris XI - Paris Sud
- Collaboration : Grid'5000
- Domaine : Informatique/Apprentissage
- inria-00380539, version 1
- http://hal.inria.fr/inria-00380539
- oai:hal.inria.fr:inria-00380539
- Contributeur : Fabien Teytaud
- Soumis le : Samedi 2 Mai 2009, 15:40:09
- Dernière modification le : Lundi 23 Avril 2012, 16:42:38
Documents associés
Exporter