|A "Knight's Tour" is a sequence of Knight's moves (L-shaped moves) around a
rectangular grid that touches each cell of the grid only once. This simulation attempts to generate
Knight's Tours using a heuristic technique called "Warnsdorff's Rule", where the next move chosen is the move with the
smallest number of legal next moves. If there is more than one optimal possible move, one is chosen randomly from the list.|
Each failure or success when generating a tour using this simulator is recorded anonymously in a server-side database. These statistics will be analysed when there are enough to be significant.
|Grid Size: 8|