Question

Greedy search strategy chooses the node for expansion in ___________

(a) Shallowest

(b) Deepest

(c) The one closest to the goal node

(d) Minimum heuristic cost

I have been asked this question in quiz.

This key question is from Informed Search and Exploration topic in chapter Problem Solving of Artificial Intelligence

Select the correct answer from above options

Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience

Answer 1

The correct choice is (c) The one closest to the goal node

To explain: Sometimes minimum heuristics can be used, sometimes maximum heuristics function can be used. It depends upon the application on which the algorithm is applied.