Multiple Choice
A* Search Algorithm _______________
A) does not expand the node which have the lowest value of f(n) ,
B) finds the shortest path through the search space using the heuristic function i.e f(n) =g(n) + h(n)
C) terminates when the goal node is not found.
D) all of the above
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q5: what is the issue of Forward State
Q6: Which search strategy is combining the benefits
Q7: The efficiency of A* algorithm depends on
Q8: _requires Linear Space but uses backtracking<br>A)breadth first
Q9: Agent interacts with the world via _
Q11: Which of the following is a sound
Q12: The statement comprising the limitations of FOL
Q13: Goal Stack Planning breaks up a _<br>A)initial
Q14: ?x ? y P(x,y) ? ? y
Q15: Is ?z S(x,y) a well-formed formula?