Knight’s Tour

Your task in this game is to reach every square with the knight without entering a square twice.

Need Help? There is a heuristic rule which greatly simplifies the process of finding a solution. The heuristic was introduced by von Warnsdorf in 1823. According to the Warnsdorf rule, the knight always moves to the field from which he has the least free (i.e. not yet visited) fields available for his next move. Wikipedia

Github

The source code for this game is freely available at: https://github.com/ArneVogel/knights-tour.