文件名称:knight
介绍说明－－下载内容均来自于网络，请自行研究使用
2、 写出6×6方阵的骑士周游的解。要求骑士的起跳位置是任意指定的。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字依次填入6×6的方阵中，并输出。
（骑士周游：从起始位置出发，按国际象棋马的走法，不重复地将所有区域恰好走一遍。）
-2, write a 6 × 6 square Cavalier travel solution. Requirements of the take-off position Cavalier arbitrary specified. The preparation of non-recursive procedures, and run routes, and routes are obtained, will be followed by fill in the number of 6 × 6 square, and the output. (Cavalier tour: starting from the initial position, according to the international chess horse walk method, not all regions will be repeated just go again.)
（骑士周游：从起始位置出发，按国际象棋马的走法，不重复地将所有区域恰好走一遍。）
-2, write a 6 × 6 square Cavalier travel solution. Requirements of the take-off position Cavalier arbitrary specified. The preparation of non-recursive procedures, and run routes, and routes are obtained, will be followed by fill in the number of 6 × 6 square, and the output. (Cavalier tour: starting from the initial position, according to the international chess horse walk method, not all regions will be repeated just go again.)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
knight.cpp