Description: Vault of the backtracking algorithm (8* 8 chess board on a horse, just walk outside except from the other 63 locations each time, finally returned to the starting point. This line is called a horse' s Hamilton traveled routes. For the a given m* n chess board, m and n are greater than 5, even, and | mn | ≤ 2, the algorithm is to find a horse' s Hamilton traveled routes.--
To Search:
- [Queue] - 8 Queen s problem is an ancient and well
File list (Check if you may need any files):
horse_CSDN\horse_csdn.cpp
..........\horse_csdn.bpf
..........\horse_csdn.bpr
..........\horse_csdn.res
horse_CSDN
Download