设计一个国际象棋的马踏遍棋盘的演示程序。

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

-To design a chess board horse travels to the demonstration program. The horses were randomly placed in 8 × 8 chess board Board [8] [8] in a box, horse by walking chess rules (see the title set p98) to move it. Requires that each box is only entered once, take the side of all the 64 squares on a chessboard. The preparation of non-recursive procedures, seeking to run for walking routes, and then find the routes will be the number 1,2,3, ..., 64 in turn fill in an 8 × 8 of the square, the output of.