AI MCQ #238: Greedy search strategy chooses the node for expansion in ___________

by

Q238. 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

✅ Correct Answer: C) The one closest to the goal node

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