八数码问题也称为九宫问题。在3×3的棋盘，摆有八个棋子，每个棋子上标有1至8的某一数字，不同棋子上标的数字不相同。棋盘上还有一个空格，与空格相邻的棋子可以移到空格中。要求解决的问题是：给出一个初始状态和一个目标状态，找出一种从初始转变成目标状态的移动棋子步数最少的移动步骤。所谓问题的一个状态就是棋子在棋盘上的一种摆法。棋子移动后，状态就会发生改变。解八数码问题实际上就是找出从初始状态到达目标状态所经过的一系列中间过渡状态。

八数码问题一般使用搜索法来解。搜索法有广度优先搜索法、深度优先搜索法、A*算法等。这里通过用不同方法解八数码问题来比较一下不同搜索法的效果-Eight digital problem also called jiugong problem. In the 3 by 3 board, place there are eight pieces, each with 1 to 8 pieces on a digital, different pieces of figures are not the same. The board has a space, and space adjacent piece that can move to the space. Asked to solve a problem is given an initial state and a target state, find a from initial into target state mobile number of pieces at least mobile steps. The problem is a state pieces on the board of a pendulum method. Moving pieces, the state will change. Solution eight digital problem is actually find out from the initial state to reach the target state after a series of intermediate transition state.

Eight digital problems generally use search method to solution. Search method has breadth first search method, the depth first search method, the A* algorithm, etc. Here by using different ways to solve eight digital questions to compare the effect of different search method