The Knight’s Tour Puzzle asks if it is possible to ?nd asequence of 64 knight’s moves so that a knight on a chessboardvisits all the di?erent squares and ends up on the startingpoint.
a) Formulate the problem in terms of graphs.
b) Can the puzzle be solved?
c) Can you ?nd an explicit solution?
d) What happens on a 3×3 chessboard
This question from Euler and Hamilton Paths and Circuits.
Thanks in advance.
