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

Discussion

What is the overall structure of the search chapter of the subject?

  • A.Optimisation, then satisfaction, then planning problems
  • B.Deterministic methods, then stochastic, then adversarial
  • C.Uninformed methods, then informed methods, then local methods
  • D.Local methods, then heuristics, then complete enumeration

Answer: C

The progression runs from search with no information, through search guided by a heuristic, to search that abandons paths entirely in exchange for constant memory. Each step trades a guarantee for a resource saving, and knowing which guarantee has been given up is what allows the right method to be chosen. Adversarial search and constraint satisfaction follow as specialisations. A sequence organised by what is surrendered at each stage is easier to hold than one organised by algorithm names.

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

Post your comment

Please log in or register to post a comment.