用数据结构(C语言版)编写程序，实现一个国际象棋的马踏遍棋盘的演示程序。具体要求为：将马随机放在国际象棋的8*8棋盘的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。用堆栈编制非递归程序求出马的行走路线，并按求出的行走路线，将数字1,2,3,……,64依次填入一个8*8的方阵，输出之。 -With the data structure (C language version) to write programs to achieve a chess board horse travels to the demonstration program. Specific requirements are: the horses were randomly placed in the 8* 8 chess board in a box, Ma according to the rules of chess to go mobile. Requires that each box is only entered once, traveled all the 64 squares on a chessboard. The preparation of non-recursive procedure with the stack order 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 matrix, the output of.