Question: The heuristic path algorithm is a best-first search in which the evaluation function is f(n) = (2 w) g(n) + w h(n) 1- For what
The heuristic path algorithm is a best-first search in which the evaluation function is f(n) = (2 w) g(n) + w h(n)
1- For what values of w is this complete?
2- For what values is it optimal, assuming that h is admissible?
3-What kind of search does this perform for:
w = 0?
w = 1?
w = 2?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
