Introduction - If you have any usage issues, please Google them yourself
Knight Parade problem: the chess board from any given knight box began to move, have to reach all the 64 squares, each square once and only entered into once. Backtracking to achieve