Description: 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.
- [diamondchessproblems.Rar] - independent diamond chess Problem descri
- [knight] - Knight, in an n* n box at the internatio
- [factor] - Integer factorization problem of positiv
- [Chess_Knight] - Cavalier demo program traversal problem.
- [Knight] - err
- [mazhouyou] - In the chessboard are like (have are lik
- [hanoi] - Recursive method used to achieve the two
- [knight] - Cavalier travel around the world is an i
File list (Check if you may need any files):
knight.cpp
Download