knights_tour
A visualisation of the Knight's Tour problem. Let's you specify an n x n chessboard and will solve for a Knight's Tour using one of two methods: a naive back-tracking attempt, or using Parberry's algorithm.
A visualisation of the Knight's Tour problem. Let's you specify an n x n chessboard and will solve for a Knight's Tour using one of two methods: a naive back-tracking attempt, or using Parberry's algorithm.