Havannah (board game)

Last updated
Examples of the three winning structures in Havannah, on a base-8 board. From left to right, they are the fork, the ring and the bridge. Havannah winning structures.svg
Examples of the three winning structures in Havannah, on a base-8 board. From left to right, they are the fork, the ring and the bridge.

Havannah is a two-player abstract strategy board game invented by Christian Freeling. It belongs to the family of games commonly called connection games; its relatives include Hex and TwixT. Havannah has "a sophisticated and varied strategy" and is best played on a base-10 hexagonal board, 10 hex cells to a side. [1]

Contents

The game was published for a period in Germany by Ravensburger, with a smaller, base-8 board suitable for beginners. It is nowadays only produced by Hexboards. [2]

Game rules

One player plays as black; the other plays as white. White starts, after which moves alternate. The rules are as follows:

An example of all three winning combinations is shown above. The structure in the centre of the board is a ring; the structure on the left-hand side is a fork; the structure on the right-hand side is a bridge.

Since the first player to move in Havannah has a distinct advantage, the pie rule is generally implemented for fairness. This rule allows the second player to choose whether to switch positions with the first player after the first player makes the first move. [4]

Players of different strength can still play an interesting game when the weaker player (as white) is allowed to place two or more stones on the first turn.

Difference compared to Hex

In Hex, when the board is completely filled, exactly one player will have a winning connection; in Havannah a completely filled board will have usually more than one winning structures (but the game ends with first winning structure).

Unlike in Hex, in Havannah draws are technically possible, in practice they are extremely rare. There has been one known draw between human players. [5] Tactics are much easier to master than strategy, and differences in playing level are considerable.

Computer Havannah

In 2002 Freeling offered a prize of 1000 euros, available through 2012, for any computer program that could beat him in even one game of a ten-game match. For many years, computer programs lagged far behind human players. However, since 2010 several Havannah-playing programs have applied Monte Carlo tree search techniques resulting in some notable improvement in playing strength. The "Havannah Challenge 2012" was held October 15–19, 2012 during which Freeling played ten games against three of the strongest Havannah-playing programs available, playing (at least) one game as black and one as white against each opponent. [6] Freeling lost the challenge when he had to resign a game with white against the Lajkonik program.

Until 2019, the best humans were still by far stronger than computers. However, MetaTotoro, based on Polygames [7] (an open-source project, initially developed by Facebook Artificial Intelligence Research and several universities [8] ), won four times in a row on the board of size 8 against the human player with the best ELO rank on LittleGolem, who was also the winner of various tournaments.

This result was achieved by the same program as the one used for beating best humans at Hex. It is a zero-learning based algorithm, as in AlphaZero, but with novelties: boardsize invariance thanks to fully convolutional neural networks (as in U-Net) and global pooling. This allows growing architectures, meaning the program can learn on a small board, and then extrapolate on a large board. [9]

Computational complexity

Solving Havannah is PSPACE-complete with respect to the size of the input graph. [10] The proof is by a reduction from generalized geography and is based on using ring-threats to represent the geography graph. In detail, since Lichtenstein and Sipser have proved that generalized geography remained PSPACE-hard even if the graph is only bipartite and of degree at most 3, it only remains to construct an equivalent Havannah position from such a graph, which is accomplished by constructing various gadgets in Havannah.

Reviews

Related Research Articles

<span class="mw-page-title-main">Reversi</span> Strategy board game

Reversi is a strategy board game for two players, played on an 8×8 uncheckered board. It was invented in 1883. Othello, a variant with a fixed initial setup of the board, was patented in 1971.

<i>Hex</i> (board game) Abstract strategy board game

Hex is a two player abstract strategy board game in which players attempt to connect opposite sides of a rhombus-shaped board made of hexagonal cells. Hex was invented by mathematician and poet Piet Hein in 1942 and later rediscovered and popularized by John Nash.

In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input length and if every other problem that can be solved in polynomial space can be transformed to it in polynomial time. The problems that are PSPACE-complete can be thought of as the hardest problems in PSPACE, the class of decision problems solvable in polynomial space, because a solution to any one such problem could easily be used to solve any other problem in PSPACE.

<span class="mw-page-title-main">Checkers</span> Board game

Checkers, also known as draughts, is a group of strategy board games for two players which involve diagonal moves of uniform game pieces and mandatory captures by jumping over opponent pieces. Checkers is developed from alquerque. The term "checkers" derives from the checkered board which the game is played on, whereas "draughts" derives from the verb "to draw" or "to move".

<span class="mw-page-title-main">Kensington (game)</span>

Kensington is an abstract strategy board game devised by Brian Taylor and Peter Forbes in 1979, named after London's Kensington Gardens, which contains the mosaic upon which the gameboard is patterned. It is played on a geometrical board based on the rhombitrihexagonal tiling pattern. The objective of the game is to capture a hexagon by occupying the six surrounding vertices. The game maintains an elegant simplicity while still allowing for astonishingly complex strategy. The placing and movement of tokens have been compared to nine men's morris.

The pie rule, sometimes referred to as the swap rule, is a rule used to balance abstract strategy games where a first-move advantage has been demonstrated. After the first move is made in a game that uses the pie rule, the second player must select one of two options:

  1. Letting the move stand. The second player remains the second player and moves immediately.
  2. Switching places. The second player becomes the first-moving player with the move already done by the opponent, and the opponent plays the first move of their new color.
<span class="mw-page-title-main">Y (game)</span>

Y is an abstract strategy board game, first described by John Milnor in the early 1950s. The game was independently invented in 1953 by Craige Schensted and Charles Titus. It is a member of the connection game family inhabited by Hex, Havannah, TwixT, and others; it is also an early member in a long line of games Schensted has developed, each game more complex but also more generalized.

<span class="mw-page-title-main">TwixT</span> Connection board game in the 3M bookshelf game series

TwixT is a two-player strategy board game, an early entrant in the 1960s 3M bookshelf game series. It became one of the most popular and enduring games in the series. It is a connection game where players alternate turns placing pegs and links on a pegboard in an attempt to link their opposite sides. While TwixT itself is simple, the game also requires strategy, so young children can play it, but it also appeals to adults. The game has been discontinued except in Germany and Japan.

The Shannon switching game is a connection game for two players, invented by American mathematician and electrical engineer Claude Shannon, the "father of information theory" some time before 1951. Two players take turns coloring the edges of an arbitrary graph. One player has the goal of connecting two distinguished vertices by a path of edges of their color. The other player aims to prevent this by using their color instead. The game is commonly played on a rectangular grid; this special case of the game was independently invented by American mathematician David Gale in the late 1950s and is known as Gale or Bridg-It.

Combinatorial game theory has several ways of measuring game complexity. This article describes five of them: state-space complexity, game tree size, decision complexity, game-tree complexity, and computational complexity.

<span class="mw-page-title-main">*Star</span> Strategy game

*Star is a complex abstract strategy game by Ea Ea, a designer of Y. It is a redevelopment of his earlier game Star.

<span class="mw-page-title-main">Christian Freeling</span> Dutch game designer (born 1947)

Christian Freeling is a Dutch game designer and inventor of abstract strategy games, notably Dameo, Grand Chess, Havannah, and Hexdame.

The Game of the Amazons is a two-player abstract strategy game invented in 1988 by Walter Zamkauskas of Argentina. The game is played by moving pieces and blocking the opponents from squares, and the last player able to move is the winner. It is a member of the territorial game family, a distant relative of Go and chess.

<span class="mw-page-title-main">Hex map</span> Map subdivided into a hexagonal tiling, small regular hexagons of identical size

A hex map, hex board, or hex grid is a game board design commonly used in wargames of all scales. The map is subdivided into a hexagonal tiling, small regular hexagons of identical size.

Star is a two-player abstract strategy board game developed by Craige Schensted. It was first published in the September 1983 issue of Games magazine. It is a connection game similar to Hex, Y, Havannah, and TwixT. Unlike these games, however, the result is based on a player having a higher final score rather than achieving a specific goal. He has since developed a slightly more complicated version called *Star with better balance between edge and center moves, writing "*Star is what those other games wanted to be."

A connection game is a type of abstract strategy game in which players attempt to complete a specific type of connection with their pieces. This could involve forming a path between two or more endpoints, completing a closed loop, or connecting all of one's pieces so they are adjacent to each other. Connection games typically have simple rules, but complex strategies. They have minimal components and may be played as board games, computer games, or even paper-and-pencil games.

<span class="mw-page-title-main">Emergo (board game)</span> Abstract board game

Emergo is an abstract strategy game created by Christian Freeling and Ed van Zon in 1986. It belongs to the "stacking" category of games, or column checkers, along with Bashni and Lasca. The name comes from the motto of the Dutch province of Zeeland: Luctor et emergo meaning: "I wrestle and emerge". The goal of the game is to capture all of the opponents pieces similar to checkers/draughts. Emergo, and all column checkers, differ from most draughts variants because of their unique method of capture. A opponent's piece is added to the capturing player's column rather than being removed. Men can be recaptured from an opponent later on in the game.

<span class="mw-page-title-main">Hexdame</span>

Hexdame is a strategy board game for two players invented by Christian Freeling in 1979. The game is a literal adaptation of the game international draughts to a hexagonal gameboard.

References

  1. Handscomb, Kerry, ed. (Winter 2002). "Front Cover". Abstract Games. Carpe Diem Publishing (12). ISSN   1492-0492.
  2. Hexboards
  3. As clarified by Freeling at http://www.mindsports.nl/index.php/arena/havannah/49-havannah-rules; Schmittberger's book wrongly states that a ring should surround at least one vacant cell.
  4. Schmittberger, R. Wayne (1992), "Havannah" , New Rules for Classic Games, John Wiley & Sons, Inc., pp.  116–17, ISBN   978-0471536215
  5. "Little Golem".
  6. "Human against Computer: 7-3 - Press release".
  7. facebookincubator/Polygames, Facebook Incubator, 2020-05-28, retrieved 2020-05-29
  8. "Open-sourcing Polygames, a new framework for training AI bots through self-play". ai.facebook.com. Retrieved 2020-05-29.
  9. Cazenave, Tristan; Chen, Yen-Chi; Chen, Guan-Wei; Chen, Shi-Yu; Chiu, Xian-Dong; Dehos, Julien; Elsa, Maria; Gong, Qucheng; Hu, Hengyuan; Khalidov, Vasil; Li, Cheng-Ling; Lin, Hsin-I; Lin, Yu-Jin; Martinet, Xavier; Mella, Vegard; Rapin, Jeremy; Roziere, Baptiste; Synnaeve, Gabriel; Teytaud, Fabien; Teytaud, Olivier; Ye, Shi-Cheng; Ye, Yi-Jun; Yen, Shi-Jim; Zagoruyko, Sergey (2020-01-27). "Polygames: Improved Zero Learning". arXiv: 2001.09832 [cs.LG].
  10. Bonnet, Édouard; Jamain, Florian; Saffidine, Abdallah (14 August 2013). Havannah and TwixT are PSPACE-complete. The 8th Intl. Conf. on Computers and Games. Keio University, Yokohama, Japan. arXiv: 1403.6518 . doi:10.1007/978-3-319-09165-5_15.
  11. "Jeux & stratégie 09". June 1981.