Hex (board game)

From Wikipedia, the free encyclopedia

The Game of Hex

A rendering of a Hex game on a 19x19 board
Players 2
Age range 4+
Setup time 1 minute
Playing time 15 minutes (11x11 board)
Random chance None
Skills required Tactics, strategy, position

Hex is a board game played on a hexagonal grid, theoretically of any size and several possible shapes, but traditionally as a 11x11 rhombus. Other popular dimensions are 13x13 and 19x19 as a result of the game's relationship to the older game of Go. According to the book A Beautiful Mind, John Nash (one of the game's inventors) advocated 14x14 as the optimal size.

Contents

[edit] History

The game was invented by the Danish mathematician Piet Hein, who introduced the game in 1942 at the Niels Bohr Institute, and also independently invented by the mathematician John Nash in 1947 at Princeton University. It became known in Denmark under the name Polygon (though Hein called it CON-TAC-TIX); Nash's fellow players at first called the game Nash. According to Martin Gardner, some of the Princeton University students also referred to the game as John (according to some sources this was because they played the game using the mosaic of the bathroom floor). In 1952 Parker Brothers marketed a version. They called their version "Hex" and the name stuck.

Hex is an abstract strategy game that belongs to the general category of "connection" games. Other connection games include Omni, Y and Havannah. All of these games are related to the ancient Asian game of Go; Nash's version of Hex, in particular, was done as a response to Go.

A finished game of Hex. Red wins.
A finished game of Hex. Red wins.

[edit] Rules

Each player has an allocated color, Red and Blue being conventional. Players take turns placing a stone of their color on a single cell within the overall playing board. The goal is to form a connected path of your stones linking the opposing sides of the board marked by your colors, before your opponent connects his sides in a similar fashion. The first player to complete his connection wins the game. The four corner hexagons each belong to two sides.

Since the first player to move in Hex 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.

[edit] Strategy

The game can never end in a tie, a fact found by John Nash: the only way to prevent your opponent from forming a connecting path is to form a path yourself. In other words, Hex is a determined game.

When the sides of the grid are equal, the game favors the first player. A standard non-constructive strategy-stealing argument proves that the first player has a winning strategy as follows:

It is obvious that since Hex is a finite, perfect information game that cannot end in a tie, either the first or second player has a winning strategy. Note that an extra move for either player in any position can only improve that player's position. Therefore, if the second player has a winning strategy, the first player could steal it by making an irrelevant move and then follow the second player's strategy. If the strategy ever called for moving on the square already chosen, the first player makes another random move. This ensures a first player win.

There are two ways to make the game fairer. One way is to make the second player's sides closer together, playing on a parallelogram rather than a rhombus. However, using a simple pairing strategy, this has been proven to result in a win for the second player.

A fairer way is to use the pie rule, aka the swap rule, by which the second player has the option of swapping colors after the first player makes the first move, or first three moves, thus encouraging the first player to even out the game. Nowadays, in most online sites, the swap rule is the default, with the swap made after only one move. In theory the swap rule ensures that the second player has a winning strategy, but in practice the first player can choose a hex for which no winning strategy is known.

Cameron Browne wrote a book entitled Hex Strategy: Making the Right Connections, which covers Hex strategy at a greater level of detail than any preceding work.[1] However, some Hex players feel that this book contains many factual errors and advocates questionable strategies. Another book, to be written by Jack van Rijswijck and Ryan Hayward, was put on hold soon after the publication of Hex Strategy; it was to have a more mathematical bent than the somewhat conversational tone of Browne's book.

[edit] Bridges and Connections

Two (groups of) stones are safely connected if nothing can stop them from being connected even if the opponent has the next move. One example of this is the bridge. Let A, B, C and D be the hexes that make up a rhombus, with A and C being the non-touching pair. To form a bridge, a player places stones at A and C, leaving B and D empty. If the opponent places a stone at B or D, the remaining hex can be filled to join the original two stones into a single group.

[edit] Paths

Two groups of stones are said to be n-connected if you can connect them safely in n moves (or, more precisely, the number of moves you must make in order to safely connect the two groups minus the number of moves your opponent makes is n). Safely connected stones, such as adjacent stones are 0-connected. Bridges are also 0-connected. The lower n is, the better for you.

A path consists of two (or more) groups of stones and an empty-point set, which is the set of empty hexes that are required for the given connections. For example, the bridge path consists of the (one-member) group of stones at A and another (one-member) group of stones at C. The empty-point set is made up of the hexes B and D. For two paths to coexist and maintain the level of connectivity they have while independent, their empty-point sets must not contain any of the same hexes (otherwise the opponent could play there).

Two 1-connected paths can be consolidated together if the two groups of stones they start and end in are the same and their empty-point sets do not overlap.

[edit] Templates

An important concept in the theory of Hex is the template. Templates can be considered a special type of 0-connected path where one of the groups of stones is the edge that you are trying to connect to.

[edit] Ladders

Ladders are sequences of forcing moves where stones are placed in two parallel lines. They can be considered normal edge templates and can be analyzed using path analysis in the same way that bridges, paths, and templates can.

[edit] Theory and Proofs

John Nash proved that a game of Hex cannot end in a tie.

In computational complexity theory, generalized Hex has been proven to be PSPACE-complete.[2]

Hex has been solved for all symmetrical playing grids up to and including 9x9: that is, a perfect strategy has been demonstrated for the first player to move, such that he is always able to win.

The determinacy of Hex has other mathematical consequences: it can be used to prove the two-dimensional Brouwer fixed point theorem, as David Gale showed in 1979,[3] and the determinancy of higher-dimensional variants proves the fixed-point theorem in general.

[edit] Variants

[edit] Blockbusters

Hex had an incarnation as the question board from the television game show Blockbusters. In order to play a "move", contestants had to answer a question correctly. The board had 5 alternating columns of 4 hexagons; the solo player could connect top-to-bottom in 4 moves, while the team of two could connect left-to-right in 5 moves.

[edit] The games of Y and Havannah

Y and Havannah are considered by some to be generalizations of Hex; they differ primarily in requiring players to connect three or more edges of a polygonal board, rather than two selected edges of a parallelogram.

[edit] Chameleon

Utilizing the same board and pieces as Hex, Chameleon gives the players the option of placing a piece of either color on the board. One player is attempting to connect the north and south edges, and the other is attempting to connect the east and west edges. The game is won when a connection between a player's goal edges is formed using either color. If a piece is placed that creates a connection between both players' goal edges (i.e. all edges are connected), the winner is the player who placed the final piece.

Chameleon is described in Cameron Browne's book Connection Games: Variations on a Theme (2005) and was independently discovered by Randy Cox and Bill Taylor.

[edit] The Shannon Switching game

See Shannon switching game. Unlike Hex, this isn't PSPACE hard.

[edit] See also

[edit] References

  1. ^ Cameron Browne. Hex Strategy: Making the Right Connections. ISBN 1568811179. 
  2. ^ Stefan Reisch (1981). "Hex ist PSPACE-vollständig (Hex is PSPACE-complete)". Acta Informatica (15): 167–191. 
  3. ^ David Gale (1979). "The Game of Hex and Brouwer Fixed-Point Theorem". The American Mathematical Monthly 86: 818-827. 

[edit] External links