As part of my AI project, KnightTour uses recursion and backtracking to solve the Knight's tour problem. That is, a knight visits every cell in the chessboard once and only one.