PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Creating an Upper-Confidence-Tree program for Havannah
Olivier Teytaud and Fabien Teytaud
In: ACG 2009(2009).

Abstract

Monte-Carlo Tree Search and Upper Confidence Bounds pro- vided huge improvements in computer-Go. In this paper, we test the gen- erality 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.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Oral)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
ID Code:6885
Deposited By:Olivier Teytaud
Deposited On:09 April 2010