我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...