Vidyalelo
Computer Science · Q579

Artificial Intelligence

Engineering and GATE · Computer Science · question 579

Q579

Greedy search strategy chooses the node for expansion in ___________

A.
Shallowest
B.
Deepest
C.
The one closest to the goal node
Answer
D.
Minimum heuristic cost

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board