Machine-translated by Google. Questions are authored in English.
Top

Discussion

How is the solution path recovered once a goal node is found?

  • A.By reading the explored set in the order it was filled
  • B.By following parent pointers back to the root
  • C.By replaying the search from the beginning to the goal
  • D.By searching backwards from the goal to the initial state

Answer: B

Each node stores the node it was generated from and the action that produced it, so the path is read off by walking up the chain and reversing it. That is the whole reason nodes carry parents rather than being bare states. Replaying, backward search and the explored set order would all be more expensive or incorrect. A small amount of bookkeeping per node, chosen so that the required output can be reconstructed, is a general design pattern. Checking the units of each quantity catches a wrong formula before the arithmetic begins.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.