Question: The heuristic path algorithm (Pohl, HEURISTIC PATH 1977) is a best-first search in which the evaluation function is f(n) = (2 w)g(n) + wh(n).
The heuristic path algorithm (Pohl, HEURISTIC PATH 1977) is a best-first search in which the evaluation function is f(n) = (2 − w)g(n) + wh(n). For what values of w is this complete? For what values is it optimal, assuming that h is admissible? What kind of search does this perform for w = 0, w = 1, and w = 2?
Step by Step Solution
3.43 Rating (156 Votes )
There are 3 Steps involved in it
It is complete whenever 0 w 2 w 0 gives fn 2gn This behaves exactly like uniformc... View full answer
Get step-by-step solutions from verified subject matter experts
