What do you mean by heuristic search? Given following state space representation, show how greedy best firsh and A* search is used to find the goal state.

- Hamro CSIT

S is the start state and G is the goal state. The heuristics of the states are:

h(S) = 12, h(A)=8, h(D)=9, h(B)=7, h(E)= 4, h(C)=5, h(F)=2, h(G)=0.

  • Answered by
  • 0 Comments
  • 1 month 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