Consider the graph given in Figure 1 below. Assume that the initial state is S and goal state is 7. Find a path from the initial state to the goal state using A* Search. Also report the solution cost. The straight line distance heuristic estimates for the nodes are as follows: - h(1) = 14, h(2) = 10, h(3) = 8, h(4) = 12, h(5) = 10, h(6) = 10, h(S) = 15. -

Result:

Path = S-4-5-6-7

Solution cost = 23