Search

• You may have come across search algorithms, like binary search of a sorted list.
• The idea of search and search spaces is this vastly expanded.
• Marvin Minsky thought improving search is the way to generate Turing Test passing AI.
• Firstly, the idea of breaking your problem (whatever it is) into a search space (or a problem space) is an important scientific method.
• For example, what is the search space for a game like tic-tac-toe. What are all the possible states, and, in this case, how do you move from one to the next.
• Once you understand the search space you can either use a general search algorithm (like minimax for tic-tac-toe), or you can develop a special algorithm for the problem.