McqMate
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) |
View all MCQs in
Advanced Neural Network and Fuzzy SystemNo comments yet