Description: Obviously the problem solving Knight traveled horse every step is a step on the board walk. At each step the horse needs to select a direction of travel, then the solution every step of the need to remember two things to remember: 1 current position Step 2 ranks the current step has sounded what direction, and come back when you can choose to back A new direction so that the use of two probe arrays, each array board remember the position of the board at the arrival of the horse steps, which reflects the solution of the problem, i.e., the position to which the first few steps. Remember array direction at a certain position of the board has been sounded in the direction of each location has eight directions, according to a certain order of eight directions number, then press the number sequence tentative direction at each location.
To Search:
File list (Check if you may need any files):
ma2.cpp
Download