Description: 8 issue of the digital problem, also known as Nine-palace. In the 3 × 3 chessboard placed eight pieces, each piece is marked 1 to 8, a number of different pieces on the subject are not the same. There is also a board space, and spaces adjacent pieces can be moved to the space. To be resolved 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 steps step.
To Search:
File list (Check if you may need any files):
20051004深度优先\8_num\8_num.cpp
................\.....\8_num.ncb
................\.....\8_num.plg
................\.....\ReadMe.txt
................\.....\StdAfx.cpp
................\.....\StdAfx.h
................\.....\8_num.opt
................\.....\8_num.dsp
................\.....\8_num.dsw
................\.....\Debug
................\8_num
20051004深度优先
Download