1.3 About Search

• Search can be particularly useful for tackling problems for which a "direct" method/algorithm is not known.
  E.g.
  • Travelling salesperson problem
  • Many optimization problems (E.g. Best NBL schedule)

• In the early days of AI, it was thought that searching through possibilities was enough. However, in interesting domains, such as chess for instance, there are way too many possibilities.

• We need to search "intelligently". That is, evaluate possibilities without having to investigate every single possibility.