Description: First of all, look at it from the starting point for the beginning of the eight directions in a few directions to go, if the direction has to take five, look at this 5 position, respectively, the next step may have a few steps away, and this value assigned to an array s [], and then carried out on the array from small to large order, and then from step 5 s [] value of the smallest go, followed by recursive, each from the s [] the value of taking the smallest, if steps step No. chessboard specifications equivalent to m* n , then the full journey if the situation encountered nowhere to go, step, back to the previous step, when time has been moved back to the starting point that can not be all ergodic.
To Search:
- [ch17] - Including a register login modules, have
File list (Check if you may need any files):
Download