Tour problems ask you to find a tour of a certain chess piece, which visits all squares on a chess board. The most famous problem of this kind is the Knight's Tour.
Besides the knight, such tours exists for the king, queen and rook.
Can you find a sequence of moves of a knight on a chessboard such that the knight visits every square only once?
Scroll down for some answers : : : : : : : : : :
: : : : : : : :
