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
Answer:C
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
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.