Difference between revisions of "Draw"
From HexWiki
(referenced to proof on Y page) |
m (added cat. theory) |
||
| Line 8: | Line 8: | ||
In fact, the no-draw property is equivalent to the 2-dimensional case of [http://en.wikipedia.org/wiki/Brouwer_fixed_point_theorem Brouwer's fixed point theorem] (a non-trivial theorem from topology saying that any continuous map from the unit square into itself must have a fixed point). | In fact, the no-draw property is equivalent to the 2-dimensional case of [http://en.wikipedia.org/wiki/Brouwer_fixed_point_theorem Brouwer's fixed point theorem] (a non-trivial theorem from topology saying that any continuous map from the unit square into itself must have a fixed point). | ||
| + | |||
| + | [[category:Theory]] | ||
Revision as of 15:10, 31 January 2008
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.
- An elegant proof using the game of Y.
- Another proof using the game of Y.
In fact, the no-draw property is equivalent to the 2-dimensional case of Brouwer's fixed point theorem (a non-trivial theorem from topology saying that any continuous map from the unit square into itself must have a fixed point).
