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

Discussion

When is iterative deepening the strategy of choice?

  • A.When the search space is large and the solution depth unknown
  • B.When step costs vary widely between different actions
  • C.When the state space is small enough to enumerate fully
  • D.When a good heuristic estimate of the distance is available

Answer: A

Its combination of completeness, optimality with unit costs and linear memory suits exactly the case where the space is too large for breadth first and the depth is not known in advance. Varying costs call for uniform cost search, a small space admits anything, and a heuristic should be used if one exists, which moves the problem into informed search. Matching the algorithm to what is known about the problem is the practical content of the comparison table.

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

Post your comment

Please log in or register to post a comment.