Knight's tour is a mathematical problem. It consists to find a path where a knight can use all cases of a chess 8x8 but only once. Brute Force method generally doesn't give results due to a huge number of possibilities in despite of 19 quadrillion of solutions.
Below, a csv file with 10'000 paths of knight on a chess 8x8. 5% of results are hamiltonians paths.
One sample
0,17,2,8,25,19,36,53,63,46,31,14,4,21,15,5,22,7,13,30,47,37,54,39,29,12,6,23,38,55,45,62,52,35,20,10,27,33,16,26,32,49,59,44,61,51,34,40,57,42,48,58,43,60,50,56,41,24,9,3,18,28,11,1
Another sample which is an hamiltonian path.
0,17,2,8,25,19,36,53,63,46,31,14,4,21,15,5,22,7,13,30,47,37,54,39,29,12,6,23,38,55,45,62,52,35,18,3,9,24,34,40,57,51,61,44,27,33,16,1,11,28,43,60,50,56,41,58,48,42,59,49,32,26,20,1
