A white knight is at c1, and the black king is at its starting position. White moves first, and tries to reach the black king, who will remain at its square. At each turn, the black king can sow a mine in any empty square. White wins if the knight reaches the King, and loses if it runs out of moves.
Who wins this game?
(In reply to
re: Making a fence: Solution? by Federico Kereki)
Sam's solution is accurate. There are only four squares that need be defended by the black king. These can be easily defended regardless of the path taken by the white knight. See my next post for a reiteration of Sam's solution.
|
|
Posted by Matthew
on 2005-03-18 19:14:08 |
re(2): Making a fence: Solution?
