S - A - C - G is the optimal solution for this problem.
UCS expands less number of nodes compared to A* search.
The heuristic function is admissible.
A* search finds the optimal solution.
BFS finds the optimal solution in terms of the number of
actions.
Α. 4 = 2 h(s) = 5, h(A) = 6, h(B) = 10, h(C) = 7, h(D) = 3, h(G) = 0 С 1 2 S 4 D 5 G 5 1 B
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!