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

Discussion

Why might an inadmissible heuristic be used deliberately?

  • A.Admissible heuristics cannot be found for most problems
  • B.Inadmissibility makes the search complete where it was not
  • C.Speed may matter more than the last few per cent of quality
  • D.Inadmissible heuristics are always cheaper to compute

Answer: C

Inflating an admissible estimate focuses the search far more sharply, and a solution found in a second within five per cent of optimal often beats one found in a minute exactly. The weighted variant bounds the loss, which turns a gamble into a decision. Computation cost, availability and completeness are not the reasons. Choosing to give up a guarantee, with the loss quantified, is a legitimate engineering decision in a way that accidentally losing it is not.

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

Post your comment

Please log in or register to post a comment.