Geometric Search Spaces

• How do you get through a maze?
• This is a classic search problem.
• 
• If you start at S, how do you get to G?
• Moreover, if you can't actually see the picture, but you're a person (or a robot) at S, and can only see in straight lines, what do you do?
• You search.
• In this case there are no loops and at most two choices, but these aren't necessary constraints.
• You can also have 3D (and even higher dimensional) searches.