Chess problem: The knight visit each square on a chess board exactly once