Q665
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)
AnswerD.
f(n) > h(n)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board