Explanation: If the evaluation function is exactly accurate, then this will indeed be the best node; in reality, the evaluation function will sometimes be off, and can lead the search astray. 8. Heuristic function h(n) is,
A. Lowest path cost
B. Cheapest path from root to goal node
C. Estimated cost of cheapest path from root to goal node
D. Average path cost
Answer:A
Explanation: If the evaluation function is exactly accurate, then this will indeed be the best node; in reality, the evaluation function will sometimes be off, and can lead the search astray. 8. Heuristic function h(n) is,
A. Lowest path cost B. Cheapest path from root to goal node C. Estimated cost of cheapest path from root to goal node D. Average path cost
Explanation: Heuristic is an estimated cost. 9. Greedy search strategy chooses the node for expansion