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 1'000'000 paths of knight on a chess 8x8.
