Date: Mar 18, 2004 10:38 PM
Author: Bill Taylor
Subject: Hex Win Proof?


It is an old theorem that in Hex, once the board has been completely
filled in with two colours, there *must* be a winning path for one
or other of them.

Now, I can prove this easily enough mathematically, but I'm wondering if
there is a simple proof, or proof outline, that would be understandable
and reasonably convincing to the intelligent layman.

Can anyone help out please?

-------------------------------------------------------------------------------
Bill Taylor W.Taylor@math.canterbury.ac.nz
-------------------------------------------------------------------------------
The empty board waits.
Stones cascade down onto it!
The game is over.
-------------------------------------------------------------------------------