29 May
2003
29 May
'03
9:57 a.m.
At 09:45 AM 5/29/03, Michael Kleber wrote:
My favorite item from the column, though, has got to be the gorgeous proof that there is no knight's tour on the 4xn chessboard, for any n.
Just in case anyone else might be confused by this: When Michael says "knight's tour", he's apparently referring to what I usually call a reentrant knight's tour; i.e., one that begins and ends on the same square. There _can_ be a non-reentrant knight's tour on a 4xn board; here are examples for n = 3 and n = 6: 10 1 8 7 4 11 2 9 6 5 12 3 1 24 3 20 11 22 4 15 12 23 8 19 13 2 17 6 21 10 16 5 14 9 18 7 -- Fred W. Helenius <fredh@ix.netcom.com>