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 I can not come up with a graphical figure of state space. Somewhere I saw (0,0),(2,2),(4,4),(6,6),(8,8),(10,10) as state space. But how to draw a figure for it?
