Question: Greedy search strategy chooses the node for expansion in ___
Options
A : Shallowest
B : Deepest
C : The one closest to the goal node
D : Minimum heuristic cost
Click to view Correct Answer
Informed Search and Exploration more questions
What are the two basic types of inferences?
Which among the following could the Existential instantiation of ?x....
A* is optimal if h(n) is an admissible heuristic-that is,....
Best-First search can be implemented using the following data structure.
Best-First search is a type of informed search, which uses....
The name ?best-first search? is a venerable but inaccurate one.....
The original LISP machines produced by both LMI and Symbolics....
The search strategy the uses a problem specific knowledge is....
Uninformed search strategies are better than informed search strategies.