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

Discussion

Why is the study of search foundational to the wider subject?

  • A.Planning, games and constraint problems are all search problems
  • B.Every artificial intelligence system contains a search algorithm
  • C.Search is the only technique that can be analysed formally
  • D.Search problems are the only ones with provable solutions

Answer: A

Adversarial games, constraint satisfaction, classical planning and much of automated reasoning are formulated as search over a space of states or of partial solutions, so the vocabulary and the analysis transfer directly. Not every system searches, other techniques are equally analysable, and provability is not confined to search. A framework that recurs across several apparently distinct subfields is worth mastering once rather than relearning in each disguise.

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

Post your comment

Please log in or register to post a comment.