Description: The eight digital also known as JiuGongTu. 3 × 3 board, put eight pieces, each piece is marked with a certain number of 1-8, the different pieces on the subject of digital is not the same. Is also a board spaces, and spaces adjacent pieces can be moved to the space. Required to solve the problem is: given an initial state and a target state, to identify the least number of steps to move a pawn move step into a initial target state.
A state of so-called problem is a pawn on the chessboard pendulum method. Pawn move, the status will change. The solution eight digital actually is to find out from the initial state to reach the target state through a series of intermediate transition state.
To Search:
File list (Check if you may need any files):
c++.txt