Knight's Tour Problem
A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once.
