Hex theory

From HexWiki
Revision as of 10:22, 22 July 2007 by Turing (Talk | contribs)

Jump to: navigation, search

Unlike many other games, it is possible to say certain things about Hex, with absolute certainty. While, for example, nobody seriously believes that black has a winning strategy in chess, nobody has been able to prove that such a strategy doesn't exist. In Hex, on the other hand, a simple argument can show that the second player certainly does not have a winning strategy from the starting position (when the swap option is not used). Whether this makes Hex a better game is of course debatable, but many find this attribute charming.

The most important properties of Hex are the following:

See also

Open problems