Introduction - If you have any usage issues, please Google them yourself
The horses were placed in the 8X8 chess board Bo A rd [0 .. 7,0 .. 7] of a box, the horse to move according to the rules for playing chess. Requires that each box is only entered once, traveled all the 64 squares on a chessboard. The preparation of non-recursive program, seeking to run for the routes, according to find the routes for the digital 1,2, ..., 64 in turn fill the square 8X8 output.