在3*3组成的九宫格棋盘上，摆有8个将牌，每一个将牌都刻有1-8中的某一个数码。棋盘中留有一个空格，允许其周围的某一个将牌向空格移动，这样通过移动将牌就可以不断改变将牌的布局。给定一种初始的将牌布局或结构（称初始状态）和一个目标布局（称目标状态），编程给出一个最优的走法序列。

-3* 3 composed of squared board, put 8 cards, each of the license are inscribed with a digital 1-8. The chessboard left a space that allows its around a brand move to the space, so that by moving the license can be changing the layout of the license. To set an initial layout of the license or structure (called the initial state) and a layout of the target (called the target state), programmed to give an optimal sequence of moves.