This application gives the user an interface to interact with and play the Knight's Tour puzzle using user input. The user decides a playing field of arbitrary size. If a user inserts a grid that cannot be won, the computer will alert the user to this. The user can also ask the computer for a solution which will be given using backtracking and recursion, finding the computationally optimal solution via Warnsdorff's rule
In simple terms, the user is meant to use a Knight Chess piece to touch every square on the board one time and one time only. Meaning, the Knight cannot come back into contact with a square that has already been touched, and every square on the board must be touched. By the end of the game a winning solution should look similar to this:
Squares needed to be traversed will be marked with an underscore _ and squares already traversed an astrisk *