Changes

Jump to: navigation, search

Havannah

7,227 bytes added, 14:34, 22 May 2018
Created page with "'''Home * Games * Havannah''' FILE:Havannah winning structures.svg|border|right|thumb| Base-8 Havannah board sample <ref>Three ways to win in Havannah, Ve..."
'''[[Main Page|Home]] * [[Games]] * Havannah'''

[[FILE:Havannah winning structures.svg|border|right|thumb| Base-8 Havannah board sample <ref>Three ways to win in Havannah, Vectorized by [https://en.wikipedia.org/wiki/User:Mysid Mysid] in [https://en.wikipedia.org/wiki/Inkscape Inkscape] on a PNG by [https://en.wikipedia.org/wiki/User:Fritzlein Fritzlein], August 14, 2007, [https://en.wikipedia.org/wiki/Havannah Havannah from Wikipedia]</ref> ]]

'''Havannah''',<br/>
a [https://en.wikipedia.org/wiki/Two-player_game two-player] [https://en.wikipedia.org/wiki/Zero-sum_%28game_theory%29 zero-sum] and [https://en.wikipedia.org/wiki/Perfect_information perfect information] [https://en.wikipedia.org/wiki/Abstract_strategy abstract strategy], [https://en.wikipedia.org/wiki/Connection_game connection] [https://en.wikipedia.org/wiki/Board_game board game] played on a base-10 or base-8 [https://en.wikipedia.org/wiki/Hex_map hexagonal board], invented in 1979 by [https://en.wikipedia.org/wiki/Christian_Freeling 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 <ref>[https://www.game-ai-forum.org/icga-tournaments/game.php?id=37 Havannah (ICGA Tournaments)]</ref>. Most competitive Programs apply variants of [[Monte-Carlo Tree Search]] and [[UCT]].

=[[Computer Olympiad|Computer Olympiads]]=
* [[14th Computer Olympiad#Havannah|14th Computer Olympiad, Pamplona 2009]]
* [[15th Computer Olympiad#Havannah|15th Computer Olympiad, Kanazawa 2010]]
* [[16th Computer Olympiad#Havannah|16th Computer Olympiad, Tilburg 2011]]

=Base-10 Board=
[[FILE:havannah-10.jpg|none|border|text-bottom|link=http://www.althofer.de/lange-nacht-jena-2009.html]]
Base-10 Board by Ed van Zon, demonstrating bridge, ring and fork <ref>[http://www.althofer.de/lange-nacht-jena-2009.html Lange Nacht der Wissenschaften - Long Night of Sciences, Jena - 2009], [[Ingo Althöfer|Ingo Althöfer's]] [[Ingo Althöfer reports to include|Pictorial report]]</ref>

=The Havannah Challenge=
In the Fall/Winter 2002 edition of the "Abstract Games" magazine, [https://en.wikipedia.org/wiki/Christian_Freeling 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 [https://en.wikipedia.org/wiki/Enschede Enschede], the [https://en.wikipedia.org/wiki/Netherlands Netherlands] at the offices of [[DGT]] over the internet using the ''igGameCenter'' <ref>[http://www.iggamecenter.com/info/en/main.html gGameCenter :: Online games for iGoogle and Facebook]</ref> <ref>[[Jan Krabbenbos]], [[Ton van der Valk]] ('''2012'''). ''The Havannah Challenge''. [[ICGA Journal#35_4|ICGA Journal, Vol. 35, No. 4]]</ref>, during which Freeling played ten games against three of the strongest Havannah-playing programs available, [https://www.game-ai-forum.org/icga-tournaments/program.php?id=697 Lajkonik] by [[Marcin Ciura]] et al., [https://www.game-ai-forum.org/icga-tournaments/program.php?id=618 Castro] by [[Timo Ewalds]], and [https://www.game-ai-forum.org/icga-tournaments/program.php?id=605 Wanderer] by [[Richard J. Lorentz|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|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 <ref>[[Ingo Althöfer]] ('''2012'''). ''Havannah – The Old Man and the C’s''. [[ICGA Journal#35_4|ICGA Journal, Vol. 35, No. 4]]</ref>.

=Publications=
==2009==
* [[Fabien Teytaud]], [[Olivier Teytaud]] ('''2009'''). ''Creating an Upper-Confidence-Tree program for Havannah''. [[Advances in Computer Games 12]], [http://hal.inria.fr/docs/00/38/05/39/PDF/hav.pdf inria-00380539 as pdf] » [[UCT]]
==2010 ...==
* [[Richard J. Lorentz]] ('''2010'''). ''[http://www.springerlink.com/content/p4x16832317r1214/ Improving Monte-Carlo Tree Search in Havannah]''. [[CG 2010]]
* [[Richard J. Lorentz]] ('''2010'''). ''Castro wins Havannah Tournament''. [[ICGA Journal#33_4|ICGA Journal, Vol. 33, No. 4]] » [[15th Computer Olympiad#Havannah|15th Computer Olympiad]]
* [[Richard J. Lorentz]] ('''2011'''). ''Experiments with Monte-Carlo Tree Search in the Game of Havannah''. [[ICGA Journal#34_3|ICGA Journal, Vol. 34, No. 3]]
* [[Jan Stankiewicz]], [[Mark Winands]], [[Jos Uiterwijk]] ('''2011'''). ''[https://www.conftool.net/acg13/index.php?page=browseSessions&form_session=1 Monte-Carlo Tree Search Enhancements for Havannah]''. [[Advances in Computer Games 13]]
* [[Junichi Hashimoto]], [[Akihiro Kishimoto]], [[Kazuki Yoshizoe]], [[Kokolo Ikeda]] ('''2011'''). ''[https://www.conftool.net/acg13/index.php?page=browseSessions&form_session=3 Accelerated UCT and Its Application to Two-Player Games]''. [[Advances in Computer Games 13]]
* [[Richard J. Lorentz]] ('''2012'''). ''Castro wins Havannah Tournament''. [[ICGA Journal#35_1|ICGA Journal, Vol. 35, No. 1]] » [[16th Computer Olympiad#Havannah|16th Computer Olympiad]]
* [[Ingo Althöfer]] ('''2012'''). ''Havannah – The Old Man and the C’s''. [[ICGA Journal#35_4|ICGA Journal, Vol. 35, No. 4]]
* [[Jan Krabbenbos]], [[Ton van der Valk]] ('''2012'''). ''The Havannah Challenge''. [[ICGA Journal#35_4|ICGA Journal, Vol. 35, No. 4]]
* [[Edouard Bonnet]], [[Florian Jamain]], [[Abdallah Saffidine]] ('''2013'''). ''Havannah and TwixT are PSPACE-complete''. [[CG 2013]] <ref>[https://en.wikipedia.org/wiki/PSPACE-complete PSPACE-complete from Wikipedia]</ref>
==2015 ...==
* [[Joris Duguépéroux]], [[Ahmad Mazyad]], [[Fabien Teytaud]], [[Julien Dehos]] ('''2016'''). ''Pruning playouts in Monte-Carlo Tree Search for the game of Havannah''. [[CG 2016]]

=External Links=
* [https://en.wikipedia.org/wiki/Havannah Havannah from Wikipedia]
* [https://www.game-ai-forum.org/icga-tournaments/game.php?id=37 Havannah (ICGA Tournaments)]
* [http://mindsports.nl/index.php/arena/havannah/ Havannah] from [http://mindsports.nl/index.php MindSports]
* [http://www.boardgamegeek.com/boardgame/2759/havannah Havannah | Board Game | BoardGameGeek]
* [http://senseis.xmp.net/?Havannah Sensei's Library: Havannah]
* [http://www.althofer.de/lange-nacht-jena-2009.html Lange Nacht der Wissenschaften - Long Night of Sciences, Jena - 2009], [[Ingo Althöfer|Ingo Althöfer's]] [[Ingo Althöfer reports to include|Pictorial report]] covers Havannah
* [http://mindsports.nl/index.php/arena/havannah/644 Havannah Challenge 2012 games]
* [http://www.youtube.com/user/TonyVanderValk?feature=watch Ton van der Valk - YouTube]

=References=
<references />

'''[[Games|Up one Level]]'''

Navigation menu