Question

Which of the following best describes how the final path is determined once the goal state is reached in the A* search algorithm?

a. Begin with the starting node and trace the order that nodes were added to the Open List until the goal node is reached.
b. Start at the goal node and iterate through each node’s parent until the starting node is reached.
c. As nodes as added to the Closed List, track the order until the goal node is added.

Answer 1

b

Step-by-step explanation:

After start from a node, immediately added to the Closed List,

In this A* approach begin with the starting node and trace the until the goal node is reached. It always checkeck least cost approach to reach goal. After reaching to goal state or stop state iterate through each