Difference between revisions of "Hex"
From HexWiki
m |
(Added complexity) |
||
| Line 1: | Line 1: | ||
'''Hex''' is a game played by two [[player]]s on a [http://en.wikipedia.org/wiki/Rhombus rhombic] [[board]] consisting of [[Hex (board element)|hexagons]]. Each player owns two of the [[Edge|sides]] of the board, and a player [[win]]s if he creates an unbroken [[chain]] between his two sides. Hex is classified as a [[Connection game]]. | '''Hex''' is a game played by two [[player]]s on a [http://en.wikipedia.org/wiki/Rhombus rhombic] [[board]] consisting of [[Hex (board element)|hexagons]]. Each player owns two of the [[Edge|sides]] of the board, and a player [[win]]s if he creates an unbroken [[chain]] between his two sides. Hex is classified as a [[Connection game]]. | ||
| + | |||
| + | Hex is a game of deep [[complexity]] and its corresponding decision-type problem is shown to be [[PSPACE-complete]]. | ||
For a description of how to play the game, see the article [[Rules]]. | For a description of how to play the game, see the article [[Rules]]. | ||
| Line 9: | Line 11: | ||
== History of Hex == | == History of Hex == | ||
| − | The [[History]] article contains an account of the events surrounding the game so far. | + | The [[History of Hex]] article contains an account of the events surrounding the game so far. |
Revision as of 09:15, 1 March 2005
Hex is a game played by two players on a rhombic board consisting of hexagons. Each player owns two of the sides of the board, and a player wins if he creates an unbroken chain between his two sides. Hex is classified as a Connection game.
Hex is a game of deep complexity and its corresponding decision-type problem is shown to be PSPACE-complete.
For a description of how to play the game, see the article Rules.
More playing
If you already have read the Rules article and you want more thorough information on how to play Hex, proceed to the article about Strategy.
History of Hex
The History of Hex article contains an account of the events surrounding the game so far.
