Knight's Tour

Problem
How can a chess knight make a complete tour of the chessboard,
 * visiting each square once and once only,
 * and ending up a knight's move from its starting square

so that its circuit is continuous?