文件名称:knight
介绍说明--下载内容均来自于网络,请自行研究使用
马的Hamilton周游路线问题,8*8  的国际象棋棋盘上的一只马,恰好走过除起点外的其它63  个位置各一次,最后回到起点。这条路线称为一条马的Hamilton  周游路线。对于给定的m*n  的国际象棋棋盘,m和n均为大于5  的偶数,且|m-n|≤2,该算法找出一条马的Hamilton周游路线。-Hamilton horse travel route problem, the 8* 8 chess board on a horse, just walked in addition to the starting point outside the other 63 locations of the first, and finally return to the starting point. This route is called a horse' s Hamilton traveled route. For a given m* n chess board, m and n are even greater than 5, and | mn | ≤ 2, the algorithm to find a horse Hamilton traveled route.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
knight.cpp