A recursive and backtracking algorithm implemented in Java for solving the Knight's Tour problem.
This program will find all of the possible solutions to a Knight's Tour for any given m x n Chess board.
This project is licensed under the MIT License - see the LICENSE file for details.