Consider \(f(N)=g(N)+h(N)\), where function g is a measure of the cost of getting from the start node…
Greedy best-first search uses \(f(N)=h(N)\). It selects nodes using only the estimated remaining cost, whereas A* combines the cost already incurred with the heuristic…
Choose your answer
Consider , 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 is used in which one of the following algorithms?
Answer and explanation
Correct answer C
Greedy best-first search uses . It selects nodes using only the estimated remaining cost, whereas A* combines the cost already incurred with the heuristic estimate as .
Practice for these exams
-
Tamil Nadu SET (TNSET)