Knight Tour with Warnsdorff's heuristic

My solution to the Knight Tour problem in action on a 8x8 chessboard. The Knight Tour problem is defined as finding a sequence of knight move on the chessboard so that all squares are visited and each square is visited exactly once. From algorithm standpoint the problem is equal to finding Hamiltonian path in a graph which is NP-complete and doesn't have an efficient solution (yet?). But the Knight moves on the chessboard constitute a specific graph for which a simple Heuristic enables finding the route in linear time called Warnsdorff's rule. See my implementation (C++) in action! Source code (C++) can be found here: https://github.com/piotr-obroslak/Che...