1.　　在３×３方格棋盘中，放８格数，剩下的没有放到的为空，每次移动只能是和相邻的空格交换数。程序自动产生问题的初始状态，通过一系列交换动作将其转换成目标排列-1. In the 3 × 3 grid board, the release number 8 grid, and the rest did not put in is empty, each mobile can only be exchanged and the number of adjacent spaces. Program automatically generates the question of the initial state, moves through a series of exchange to convert into a goal with