Description: 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.
File list (Check if you may need any files):
马的 Hamilton周游路线问题\DATA1010.txt
.........................\DATA1012.txt
.........................\DATA66.txt
.........................\DATA68.txt
.........................\DATA810.txt
.........................\DATA88.txt
.........................\马的 Hamilton周游路线问题.cpp
马的 Hamilton周游路线问题
Download