Other State Spaces

• It's relatively easy to see how this works for discrete mazes.
• How might it work for searching for a combination for lock?
• How about for a method for synthesising a chemcial?
• The idea in both of these cases is that there are a series of discrete operations that are available.
• The system can search through each in a systematic (or heuristic) way.
• The problem then becomes decomposing the original problem into a search space, then
• using a search algorithm to find a good (or optimal) result.