Introduction - If you have any usage issues, please Google them yourself
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