八数码问题

在3×3的棋盘，摆有八个棋子，每个棋子上标有1至8的某一数字，不同棋子上标的数字不相同。棋盘上还有一个空格，与空格相邻的棋子可以移到空格中。要求解决的问题是：给出一个初始状态和一个目标状态，找出一种从初始转变成目标状态的移动棋子步数最少的移动步骤。

-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.