Knight

Oh how I hate chess. And yet I had to spend many hours last night making this program for my school project. It’s a very simple Knight’s Tour solution generator. Basically, for those of you too lazy to click that link, a Knight’s Tour is a lame chess puzzle where you have to move a knight piece to every single square on the chessboard without going to any squares twice. My equally-lame program basically lets you chose any square as the starting point and gives you the moves necessary to complete a Knight’s Tour. The solution is generated on-the-fly each time so you can have multiple solutions for the same starting point if you run it multiple times. It’s written in C# so you probably need the .NET Framework to run it.

The output for the step-by-step instructions needed to duplicate the solution is written in an annotation I made up instead of the standard coordinate system used for chess logs. See if you can figure it out… (hint: what is the maximum number of ways a knight can move from any square?)