Conclusion of Search

• Search is important and there are a lot of ways to search.
• Exhaustive techniques like DFS and BFS are optimal and usable on small spaces.
• Heuristic methods can be easier to program. In large spaces they may be the only way to solve a problem.
• Defining your problem in terms of a search space is an excellent way to understand it.
• Particular types of search spaces are best solved by particular algorithms.
• For next week, read Some studies in machine learning using the game of checkers. by A.L. Samuel. You could also read Russell and Norvig chpts 18, 19, 20 and 22.