Description: Eight 3 × 3 digital issues in the board, placed eight pieces, each piece marked with number 1 to 8, a different number of pieces on the subject is not the same. There is also a board space, and spaces adjacent pieces can be moved to the space. For the settlement of the question is: given an initial state and a target state, to find a target state from the initial movement into the least number of pieces of mobile-step procedure.
To Search:
File list (Check if you may need any files):
MySpath\Debug
.......\.....\MySpath.exe
.......\.....\MySpath.ilk
.......\.....\MySpath.pdb
.......\MySpath.ncb
.......\MySpath.sln
.......\MySpath.suo
.......\MySpath
.......\.......\Debug
.......\.......\.....\BuildLog.htm
.......\.......\.....\mt.dep
.......\.......\.....\MySpath.exe.intermediate.manifest
.......\.......\.....\Spath.obj
.......\.......\.....\vc90.idb
.......\.......\.....\vc90.pdb
.......\.......\MySpath.vcproj
.......\.......\MySpath.vcproj.FAREAST.v-xowng.user
.......\.......\Spath.cpp
.......\.......\Spath.h
Download