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

-The horses were placed in 8 × 8 chess board Board [0 ~ 7] [0 ~ 7] in a box, the horse in accordance with the rules for playing chess move. Required to enter each square only once, traveled all the 64 squares on a chessboard. The preparation of non-recursive procedures, seeking to lobby the walking routes, walking routes calculated in accordance with, the number 1,2, ..., 64, fill in an order of the 8 × 8 matrix, the output of