Difference between revisions of "Draw"
From HexWiki
(some corrections and link for Brouwer's Fixed Point Theorem) |
|||
| Line 6: | Line 6: | ||
* A [http://www.cs.ualberta.ca/~javhar/hex/hex-yproof.html elegant proof] using the [[Y|game of Y]]. | * A [http://www.cs.ualberta.ca/~javhar/hex/hex-yproof.html elegant proof] using the [[Y|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 | + | 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). |
Revision as of 14:21, 31 March 2006
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 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).
