Prepare state space graph for the following puzzle problem, where only move left, move right, move up and move down actions are allowed. On the so constructed state space, label the states as A, B, C, ……Z and use the greedy best to test whether it finds the goal or  not.

Initial State:

1 2

Goal State:

1
2

Assume the path cost from one step to another as 1 and heuristic function, f(n), as a number of misplaced cells.

  • Answered by
  • 0 Comments
  • 3 months ago

This answer is restricted. Please login to view the answer of this question.

Login Now
Leave your Answer:

Click here to submit your answer.

s
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments