Artificial Intelligence207610 marksInformed Search
Construct a state space with appropriate heuristics and local costs. Show that Greedy Best First search is not complete for the state space. Also illustrate A* is complete and guarantees solution for the same state space.
Construct a state space with appropriate heuristics and local costs. Show that Greedy Best First search is not complete for the state space. Also illustrate A* is complete and guarantees solution for the same state space.[10]
Below is a carefully designed state space that demonstrates the incompleteness of Greedy Best First Search while showing A remains complete and optimal. More precisely, define the following state space: Node h(n) ------------ S 6 A 1 B 2 G 0 Note: h(A) = 1 is intentionally misleading. Node A look...