文件名称:Hamilton
介绍说明－－下载内容均来自于网络，请自行研究使用
8*8 的国际象棋棋盘上的一只马，恰好走过除起点外的其它 63 个位置各一次，最后回
到起点。这条路线称为一条马的 Hamilton 周游路线。对于给定的 m*n 的国际象棋棋盘，m
和n均为大于5的偶数，且|m-n|≤2，试设计一个分治算法找出一条马的Hamilton周游路线。
编程任务：
对于给定的偶数m，n≥6，且|m-n|≤2，编程计算 m*n 的国际象棋棋盘一条马的Hamilton
周游路线。 -8* 8 chess board on a horse just walked outside than from the other 63 positions each time, and finally returned to the starting point. This line is called a horse' s Hamilton travel routes. For a given m* n chess board, m and n are even greater than 5, and | mn | ≤ 2, the partition algorithm to design a test to find a horse of Hamilton travel routes. Programming task: For a given even number m, n ≥ 6, and | mn | ≤ 2, programming computing m* n chess board a horse Hamilton travel routes.
到起点。这条路线称为一条马的 Hamilton 周游路线。对于给定的 m*n 的国际象棋棋盘，m
和n均为大于5的偶数，且|m-n|≤2，试设计一个分治算法找出一条马的Hamilton周游路线。
编程任务：
对于给定的偶数m，n≥6，且|m-n|≤2，编程计算 m*n 的国际象棋棋盘一条马的Hamilton
周游路线。 -8* 8 chess board on a horse just walked outside than from the other 63 positions each time, and finally returned to the starting point. This line is called a horse' s Hamilton travel routes. For a given m* n chess board, m and n are even greater than 5, and | mn | ≤ 2, the partition algorithm to design a test to find a horse of Hamilton travel routes. Programming task: For a given even number m, n ≥ 6, and | mn | ≤ 2, programming computing m* n chess board a horse Hamilton travel routes.
相关搜索： Hamilton
(系统自动生成,下载前可以参看下载内容)
下载文件列表
马的 Hamilton周游路线问题\DATA1010.txt
.........................\DATA1012.txt
.........................\DATA66.txt
.........................\DATA68.txt
.........................\DATA810.txt
.........................\DATA88.txt
.........................\马的 Hamilton周游路线问题.cpp
马的 Hamilton周游路线问题
.........................\DATA1012.txt
.........................\DATA66.txt
.........................\DATA68.txt
.........................\DATA810.txt
.........................\DATA88.txt
.........................\马的 Hamilton周游路线问题.cpp
马的 Hamilton周游路线问题