Α. 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
Posted: Fri Nov 26, 2021 8:31 am
- 1 (14.55 KiB) Viewed 36 times
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