Creating an Upper-Conﬁdence-Tree program for
Olivier Teytaud and Fabien Teytaud
In: ACG 2009(2009).
Monte-Carlo Tree Search and Upper Conﬁdence 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 diﬃcult for computers. We show that
the same results hold, with slight diﬀerences 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.