ICFP 2002 entry for OaSys
see http://icfpcontest.cse.ogi.edu/ for details of contest
Contact: Terry Stewart at terry@oasys.ca

Overview:
 A fairly simple little program.  Here's the basic logic:
    if we can drop packages to get points, do so
    if we can pick up packages, pick up as many as possible 
		(weighted by distance to destination)
    if we have packages, go towards the closest one's destination
    otherwise, go to the nearest base 
		(ignoring ones we are pretty sure are empty)
 One neat trick: 
  When going towards a particular location, it will try to avoid running
  into other robots (as long as that doesn't slow it down getting to its target)

 Finding a path to a location is done by determining the distance from 
  every point on the map to the target (and caching this data, of course)

Notes:
 The entire code is just one python script file.  I've included a really
silly 'buildme' file, as requested, which makes an equally silly 'runme'
file.  I hope they work on the test system -- my shell script skills are
rather rusty.

 This robot is written to be as mindless as possible.  The idea was to avoid
conflict and thus hopefully avoid the deadlock situation (where two or more
robots are repeatedly pushing each other and getting nowhere).  In the
short term, cooperating helps all robots in the game, but I'll assume that
in the long run it'll benefit me.

Things to add:
 The robot should probably also try to stay away from water like it tries to
stay away from other robots.  Also, a better algorithm for deciding what
to pick up is needed.  It should weight having many small packages much
higher than a few large pacakages, since we only drop one when pushed.
