Difference between revisions of "Draw"

Revision as of 11:02, 16 February 2005

One of the beautiful properties of Hex is that the game can never end in a draw, i.e., there is always a winner.

There are various ways of proving this, for example:

• A proof by David Gale that used the fact that exactly three hexes meet at every vertex.
• A elegant proof using the game of Y.

In fact, the no-draw property is equivalent to Brouwer's fixed point theorem (a non-trivial theorem from topology saying that any continuous map from the unit square onto itself must contain a fixed point).