Problem
A knight in chess moves in an "" pattern - two squares in one direction and one square in a perpendicular direction. Starting in the bottom right corner of a regular chessboard, is it possible for a knight to visit every square on the chessboard exactly once and end up in the top left corner?