Artificial Intelligence - Old Questions

1. 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.

Here, when search reaches at node C it stucks in loop. So we can't reach at goal node. Therefore, Greedy Best First Search is not complete for the given state space.