Conclusion

• Take Home Points
  1. Describing a difficult problem with a search space can really help find a solution.
  2. It's often not easy.
  3. Properties of the search space inform the selection of search algorithms.
  4. Depth First Search is a simple exhaustive algorithm.
  5. There are lots of other search algorithms.
• Reading: For this lecture read Russell and Norvig Chapter 1 Solving Problems by Searching (pp 66-111)
• Reading: For next week read Russell and Norvig 2.1.4 (Beyond Classical Search (pp. 129-132) and the GA Wiki.