a. Create an algorithm for heuristically searching and/or graphs. Note that all descendants of an and node must be solved to solve the parent. Thus, in computing heuristic estimates of costs to a goal, the estimate of the cost to solve an and node must be at least the sum of the estimates to solve the different branches.

b. Use this algorithm to search the graph in Figure 4.31.

Figure 4.31

Transcribed Image Text:

B h(A) = 1 h(B) = 2 h(C) = 5 h(D) = 3 h(E) = 2 E A h(F) = 5 h(G) = 1 h(H) = 3 h(l) = 1 H D F LL