From Chessprogramming wiki
Jump to: navigation, search

Home * Games * Havannah

Base-8 Havannah board sample [1]

a two-player zero-sum and perfect information abstract strategy, connection board game played on a base-10 or base-8 hexagonal board, invented in 1979 by Christian Freeling. The pattern of cells are filled with stones one by one. To win, one has to be the first to connect three sides ("fork") or two corners ("bridge") or to form a ring. Computer Havannah is played at the Computer Olympiad organized by the ICGA since 2009 [2]. Most competitive Programs apply variants of Monte-Carlo Tree Search and UCT.

Computer Olympiads

Base-10 Board


Base-10 Board by Ed van Zon, demonstrating bridge, ring and fork [3]

The Havannah Challenge

In the Fall/Winter 2002 edition of the "Abstract Games" magazine, Christian Freeling claimed in an open letter that Havannah is too difficult for computers, and that within 10 years no program would be able to achieve a single win against him in a match over ten games - on a base-10 baord, and wagered a €1000 prize money. The challenge match was held October 15–19, 2012 in Enschede, the Netherlands at the offices of DGT over the internet using the igGameCenter [4] [5], during which Freeling played ten games against three of the strongest Havannah-playing programs available, Lajkonik by Marcin Ciura et al., Castro by Timo Ewalds, and Wanderer by Richard Lorentz et al., playing (at least) one game as Black and one as White against each opponent. The match ended in a 7-3 score for humanity, but not 10-0, and Freeling already lost the challenge at game 2, when he had to resign a game with white against Lajkonik. In the first game, its parameters selected by Rémi Coulom's CLOP in quick games versus Castro, Lajkonik played poorly. Marcin used CLOPless values relying on intuition and some test positions for the second game, which Lajkonik won [6].



2010 ...

2015 ...

External Links


Up one Level