Knight Terror - 0.01

Investigating the commonly posed CS problem of calculating a "Knight's Tour".



Calculates a knight's tour using the Warnsdorff algorithm.
You can also put it on a plain brute force mode to illustrate
how utterly ineffective this approach is.

If you are not familiar with Warnsdorff's algorithm or with the problem of finding a Knight's Tour in general please see the wikipedia page on this subject.
http://en.wikipedia.org/wiki/Knight's_tour

Controls:
Mouse: Place knight, click buttons

HotKeys:
Space: Start
Enter: Reset
+ : Increase FPS
- : Decrease FPS
w : Toggle between Warnsdorff/Brute
# : Toggle showing path numbers on/off
c : Toggle continuous solution mode on/off
r : Replay current tour
n: Pop the stack and find next tour
Esc : Quit

Note:
Searching for a closed tour specifically is not yet implemented.
The tour you find may be closed but you are much more likely to find open tours.