2
$\begingroup$

Is it true that for all $n\geq 5$, there is a knight's tour of an $n\times n$ chessboard beginning at every square?

For example, is it correct, that there is no solution for a $5\times5$ board, with start position $(5,4)$?

$\endgroup$
  • $\begingroup$ I've tried my given example. With no result. $\endgroup$ – user1511417 Jan 1 '15 at 20:31
5
$\begingroup$

The Wikipedia article links to several useful papers. According to the paper Solution of the knight’s Hamiltonian path problem on chessboards, there is no such tour; see Theorem 3.1(ii). They show that a knight's tour on the 5x5 board always starts or ends at a corner. It's also easy to see that both endpoint squares have the same color. Since the (5,4) square has a different color than the corners, no knight's tour starts at (5,4).

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.