Q.

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)
Answer» C. f(n) = h(n)
2.2k
0
Do you find this helpful?
18

Discussion

No comments yet