A knight$$s tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once.

Knight's move in an L$-$shape on the chessboard. That is either two squares horizontally and one square vertically or one square horizontally and two squares vertically.

Your algorithm only needs to find one solution to the problem. Your output can look something like this:

$0059383330170863$

$3734316009622916$

$5801363932271807$

$3548412661101528$

$4257024940230619$

$4750455425201114$

$5643520322132405$

$5146554453042112$

In this case, $00$ is the position where the knight started.

On the next move the Knight landed at $01,$ then $02,$ etc.