===========================================================================

Micromouse Maze solver Ver 1.0

For bugs and suggestions for improvement contact:

<sachin.surendran@gmail.com>

===========================================================================



Hi Reader,

     Find in the folder code for simulator and algorithm demonstration
of Micrmouse,This Algo as proven can solve any maze and find THE SHORTEST
path to the center.

   The demo shows lots of mouse movement, though in actual world the mouse
would not do that much motion,as that would tire the mouse and let us out of thecompetetion.

The reason why we are seeing lot of mouse movement,is actually to give an
idea as to how the algorithm thinks ( you must have seen in a chess game
some visuals of how the computer thiks its next moves, you will see it taking 
all best possiblities).

Basically the mouse will go discovering each cell only once, or sometimes
will never visit them based on how good its doing.

How to compile:
===============
On a linux machine with X11 libraries, you will need to 
execute the 'comp' file which is packaged with the source
This is how to do it:

./comp

This will build the executable 'maze'

Then in Xwindows environmnt,ie Linux equivalent of windows,

open a Xterm in that and 'cd' to the source directory
then execute the 'maze' executable with argument as the
path of an '.maz' file,this .maz file should be present 
in same directory as the exe, else we should specify the path
where it is present.

Note:Find some bunch of maze files with this distribution

This is how to do it:

./maze japan1.maz

This will open the maze simulator and you will see the visual
of how the algo cracks open the maze :)

Njoy
Sachin