Solve this problem using the A* search algorithm.

A machine is going to navigate through a series of cave connected by straight tunnels(Please see image). It starts navigating from the A to the last cave G. Some tunnels can only be navigated in one direction. Arrows are showing which cave can be reached from which other cave. For example from cave D to B is possible, however from cave B to D is not possible. All the coordinates ar given in the picture.

 Please show the calculations and steps. 

Transcribed Image Text:

A(2,8 DC7,6) F (11,6) C(14,5) B(3,2) EC11,2) O G44,0) A(2,8 DC7,6) F (11,6) C(14,5) B(3,2) EC11,2) O G44,0)

Answer rating: 100% (QA)

A Algorithm A search algorithm is a combination of both uniform cost search and greedy bestfirst search algorithms It uses a heuristic function to fin... View the full answer