Introduction - If you have any usage issues, please Google them yourself
Cavalier this is a location problem, in a standard 8 × 8 chess chessboard, checkerboard lattice, some of that there may be some obstacles. Cavalier known initial position and target location, your task is to calculate the number of step-by-step Cavalier at least from the initial position to reach the goal.
Packet : 43680538knight.rar filelist
knight\knighti.cpp
knight\I12 -- 骑士问题.files\12_1.JPG
knight\I12 -- 骑士问题.files\12_2.JPG
knight\I12 -- 骑士问题.files\goback.jpg
knight\I12 -- 骑士问题.files\home.jpg
knight\I12 -- 骑士问题.files\table_back.jpg
knight\I12 -- 骑士问题.files\top.jpg
knight\I12 -- 骑士问题.htm
knight\I12 -- 骑士问题.files
knight