Problem #PRU-100444

Problems Methods Colouring Chessboard colouring

Problem

Can a knight start at square a1 of a chessboard, and go to square h8, visiting each of the remaining squares exactly once on the way?