Knight's tour

The earliest known references to the Knight's Tour problem date back to the 9th century. The Knight's Tour is a mathematical problem involving a knight on a chessboard. The knight is placed on the empty board and, moving according to the rules of chess, must visit each square exactly once.