1) Consider the following graph- 10 A 2 8 B 5 10 5 8 3 10...

   

Transcribed Image Text:

1) Consider the following graph- 10 A 2 8 B 5 10 5 8 3 10 5 3 6 1 H 3 E 5 The numbers written on edges represent the distance between the nodes. The numbers written on nodes represent the heuristic value. Find the most cost-effective path to reach from start state A to final state J using A* algorithm. 1) Consider the following graph- 10 A 2 8 B 5 10 5 8 3 10 5 3 6 1 H 3 E 5 The numbers written on edges represent the distance between the nodes. The numbers written on nodes represent the heuristic value. Find the most cost-effective path to reach from start state A to final state J using A* algorithm.