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
Answer» B. finds the shortest path through the search space using the heuristic function i.e f(n)=g(n) + h(n)
1.7k
0
Do you find this helpful?
7

Discussion

No comments yet