# Knight's tour from all starting positions

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)$?

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