Home / Engineering / Artificial Intelligence and Robotics (AIR) / Question

M

Madhu • 12.02K Points
Tutor II

Q.) 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 : Option (B) - finds the shortest path through the search space using the heuristic function i.e f(n)=g(n) + h(n)

Share

Discusssion

Login to discuss.