Problem
A knight in chess moves in an “L” pattern – two squares in one direction and one square in a perpendicular direction. Starting with a knight in the bottom right corner of a regular chessboard, can you move it some number of times according to the rules in such a way that it visits every square on the chessboard exactly once and ends up in the top left corner?