AI MCQ #239: What is the evaluation function in greedy approach?

by

Q239. What is the evaluation function in greedy approach?

  • a) Heuristic function
  • b) Path cost from start node to current node
  • c) Path cost from start node to current node + Heuristic cost
  • d) Average of Path cost from start node to current node and Heuristic cost

✅ Correct Answer: A) Heuristic function

Explanation: Greedy best-first search3 tries to expand the node that is closest to the goal, on the grounds that this is likely to lead to a solution quickly. Thus, it evaluates nodes by using just the heuristic function: f (n) = h(n).