« My inner classical music | Main | School »

There are no magic knight's tours on the chessboard

From MathWorld News. Two Frenchmen set up a computation that lasted for 61.40 days in which they exhausted all knight's tours on the chessboard. They found 140 semimagic knight's tours, but none of them were diagonally magic. Thus a 150-year old problem has been solved.

Posted by Guan Yang on September 7, 2003 02:16 PM |

Post a comment

(If you haven't left a comment here before, you may need to be approved by the site owner before your comment will appear. Until then, it won't appear on the entry. Thanks for waiting.)