Introduction - If you have any usage issues, please Google them yourself
1 Description of the problem
On the board a n* n chessboard, a horse of a location can be just visit each square once and return to the starting position?
The general idea of backtracking
The depth-first search, to find solutions to meet the requirements, then output Otherwise, push back on the layer down a direction to search.
3 backtracking algorithm for solving the problem described
Sequentially enumeration for the current location (x, y) of the n-th direction search until it finds a set of feasible solutions so far. 3: use pruning first, Warnsdorff s rule, enumerate the current direction when Select Next feasible steps at least Second, if the first point in the direction of the existence of more than one, the Select from the center the direction of the remote location each time starting from the center point of departure, the unknown path mapped back to the pan and then obtained a legitimate path.
Algorithm key skills
In the checkerboard larger when using the recursive ma