将马随机放在国际象棋的8×8棋盘Board[0～7][0～7]的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1，2，…，64依次填入一个8×8的方阵，输出之 -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