Efficiency of Heuristic Algorithm

In any search problem, each node has b choices and the depth d of reaching the target. An unskilled algorithm usually needs to search bd nodes to find the answer. Heuristic algorithm reduces the branching factor by using some cutting mechanism to improve the search efficiency, from B to a lower B'. The divergence rate can be used to define the partial order relation of heuristic algorithm. For example, if the branching rate of h 1(n) is lower than h2(n) on the n-node search tree, then H 1 (n)