WBCHSE Applied AI Practice Questions - West Bengal Higher Secondary Applied Artificial Intelligence Exam

What defines an 'admissible heuristic' h(n) in the A* search algorithm for finding optimal paths?

It always overestimates the actual cost to reach the goal node. It never overestimates the true minimum cost to reach the goal node from node n. It equals the exact sum of path cost g(n) and heuristic cost h(n). It fluctuates dynamically depending on memory constraints.

Correct Answer:

It never overestimates the true minimum cost to reach the goal node from node n.

Access more questions from this quiz

Continue to WBCHSE Applied AI Practice Questions - West Bengal Higher Secondary Applied Artificial Intelligence Exam for more practice questions and the full quiz experience.

Access More Questions