Maze
- Here's a really simple maze. You start at S the
start state and want to go to G the goal state.
- How do you reperesent it?
- (You could form a problem space to answer this question, and there are
an infinite number of ways to do it, but that's probably too much.)
- How about labelling the as yet unlabelled end points and intersections
from left to right.
- So, (1,G,2,3,S,4,5,6,7,8,9,10).
- You still need to describe the joins so,
- (1-3,2-3,3-S,G-4,S-5,4-5,5-7,6-8,7-8,8-9,7-10).
- Note that this is a graph structure, and arcs are bidirectional.
- Can you think of another way to describe it?
- How do you find a path through this maze?
