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

Discussion

What is the risk of a narrow beam width?

  • A.The search consumes more memory than a full best first search
  • B.The heuristic ceases to be admissible during the search
  • C.The algorithm cannot terminate once the beam is full
  • D.The path to the goal may be discarded early

Answer: D

Pruning to a fixed width may discard the only node leading to the goal, and once discarded it is never reconsidered, so the search can fail on a problem that has a solution. Widening the beam trades memory for reliability, and stochastic variants keep some diversity. Memory falls rather than rises, admissibility is a property of the heuristic, and termination is unaffected. An approximation whose failure mode is silent deserves particular care in deployment.

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

Post your comment

Please log in or register to post a comment.