A Knight's Tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once. There are several solutions with only 64 moves.
Reference: Wiki