Knight's Tour

Problem

Given the starting position of a knight on an 8x8 chessboard, find a sequence of moves such that the knight visits every square on the board exactly once.