AI MCQ #224: What is the heuristic function of greedy best-first search?

by

Q224. What is the heuristic function of greedy best-first search?

  • a) f(n) != h(n)
  • b) f(n) < h(n)
  • c) f(n) = h(n)
  • d) f(n) > h(n)

✅ Correct Answer: C) f(n) = h(n)

Explanation: No explanation provided.