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.

  • 1 Comments
  • 1 year ago

This question doesn't have any answer. Please request admin for answer or submit your own answer.

Submit Answer
Leave your Answer:

Click here to submit your answer.

Subscribe
Notify of
1 Comment
Oldest
Newest Most Voted
Inline Feedbacks
View all comments