Submitter:	Alan Halverson
Team Name:	arock

Details:

My entry is written in C++.  Pretty straightforward design.  I really don't
think about the other robots as I move around exploring bases and delivering
packages.  I always spend one coin per move.

My path discovery is handled by a modified Bellman flooding algorithm.  The
details of how my algorithm works can be found at
http://micromouse.cannock.ac.uk/maze/fastfloodsolver.htm.  When I have no
packages, my goals are the home bases, and when I do, the goals are the package
destinations.

My entry will be suceptible to situations where other robots are close by.  I
played one game on the test server where I was stuck in a loop of picking up a
package, getting pushed, coming right back, rinse, lather, repeat.  The good
news is that the other robot wasn't making progress either, but a third robot
in that scenario could clean up the rest of the board.

Hopefully my entry scores a couple of points.  It was fun to write it, although
I'm not sure my kids or my wife would agree.  :)

_Alan

