Consider f (N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of…
Consider f (N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms?
Show answerHide answer
Correct answer: (C) Greedy best first search algorithm
Explanation
The greedy algorithm work in a way that it has same estimate (called a heuristic) of how for from the goal any vertex is. Instead of selecting the vertex closet to the starting point, it selects the vertex closet to the goal, so the answer is (c).