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

Discussion

What is a heuristic in artificial intelligence?

  • A.A measure of how much memory an algorithm will require
  • B.A formal specification of the problem to be solved
  • C.A rule of thumb that guides search without guaranteeing the best result
  • D.A proof that an algorithm will find the optimal solution

Answer: C

A heuristic estimates how promising a state is, so search can be directed rather than exhaustive, and it trades a guarantee for tractability. Admissible heuristics preserve optimality while still pruning enormously. Proofs, resource bounds and specifications are separate concepts. Accepting a method that usually works in exchange for one that is computationally impossible is the central bargain of practical artificial intelligence.

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

Post your comment

Please log in or register to post a comment.