15数码问题的求解思路，给定一个最小的h*，递归地增加h*的值，每次加一，直到找到最优解。(Given a minimum h*, the solution of the 15-digit problem increases the value of h* recursively, one at a time, until the optimal solution is found.)