Greedy search strategy chooses the node for expansion
A. Shallowest
B. Deepest
C. The one closest to the goal node
D. Minimum heuristic cost
Answer:A
Greedy search strategy chooses the node for expansion
A. Shallowest B. Deepest C. The one closest to the goal node D. Minimum heuristic cost