0

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?

nbro
  • 39,006
  • 12
  • 98
  • 176
npsulav
  • 1
  • Do you know what being complete means? That's the first step to answer your question. Also, your homework problem doesn't tell you to draw the state space, but just to construct it. – nbro Jun 12 '23 at 09:05
  • Actually I am not getting the idea what this question is trying to ask for. – npsulav Jun 14 '23 at 13:30
  • I think you need to describe (not necessarily draw it) a state space with costs in the edges and a heuristic function (that estimates the costs to the goal) in such a way that the greedy BFS will not be able to find any solution and will continue to search forever or maybe get stuck, while A* will find a solution. – nbro Jun 15 '23 at 08:22

0 Answers0