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)
I have been asked this question in a national level competition.
My question comes from Informed Search Strategy topic in division Problem Solving of Artificial Intelligence