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

Discussion

What is a loopy path?

  • A.A path that alternates between two branches of the tree
  • B.A path that revisits a state it has already passed through
  • C.A path that returns to the start without reaching the goal
  • D.A path whose total cost is zero because of negative steps

Answer: B

A loopy path is a special case of a redundant path in which the same state appears twice, and it can always be shortened by removing the loop, so it is never part of an optimal solution. Detecting loops along the current path is cheaper than a full explored set and is enough to make depth first search complete in a finite space. Return to the start and negative costs describe different situations. Cheap partial cycle detection is often the right compromise when memory is scarce.

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

Post your comment

Please log in or register to post a comment.