Title: Knight Tour
This is a demonstration of a brute force algorithm to calculate the "Knight's tour" for an arbitrary board size and starting position. The algorithm does a depth-first search for a combination of moves of a knight chess piece that will allow the knight to visit every square exactly once. As you can guess, the algorithm is quite inefficient, and the time required to calculate the sequence increases exponentially as board size increases, so calculating for a board size of 8 takes awhile.
Notice: Please do not direct link to any files on this site, link
to the page containing the file! Thanks!
UPDATE: Too many people seemed to be searching for this for their homework, so I've taken the files offline.