Introduction - If you have any usage issues, please Google them yourself
The horses were randomly placed in 8 × 8 chess board Board [0 ~ 7] [0 ~ 7] in a box, the horses go by the rules of chess moves. Required to enter each square only once, traveled all the 64 squares on a chessboard. Prepare a non-recursive program, seeking to run for the routes, according to find the routes, the numbers 1, 2, ..., 64 followed by a 8 × 8 filled the square, the output of the