Search

• There were two crucial bits for the search lecture.
• The first was that there are a lot of search algorithms.
• Depth First and other exhaustive techniques
• Best first and other heuristic algorithms
• Adversarial search (e.g. minimax)
• and 100s of others
• The second was that converting your problem to a state space can enbable you to understand the problem.
• Once it's understood, you may be able to use standard techniques to solve it, including search.
• Either way, understanding the problem is often really important and difficult, and any technique that helps is valuable.