[chbot] Micromouse maze solving strategies

[Carl Ranson]

I've been thinking this problem through and I can see that finding the 
shortest/fastest path is equivalent to the shortest path problem in 
graph theory.

Now Im thinking about the process of discovery, an whether you'd need to 
investigate the whole maze or not. The obvious process to discover the 
maze is to always go straight, right, left or back as possible and 
backtrack to spots where there were more than one possibility. This is 
gaurenteed to discover the whole maze and seems to be what the simulator 
program does.

If the goal always is always in the center of the maze, would it be 
possible to gear the turn decisions with the goal of discovering the 
area between the center of the maze and start point first?
C