A knight's tour is a numbered tour of a knight over an otherwise empty chessboard visiting each square once only. A queen placed on the start of a tour discovered by George Jelliss can attack all of the odd primes, and every odd number attacked by the queen is a prime. It is also a more restricted version known as a re-entrant tour, in which the knight, on its 64th move, could arrive back at its starting square. The sum of the odd primes in the tour is 499.
|A Knight's Tour|
Submitted: 2008-02-20 21:58:54; Last Modified: 2009-03-12 20:44:46.