ICFP 2002 programming contest entry by Stephen E. F. Villee

This program is written in C.

It is fairly rudimentary.  It always bids 1, so my robot may well
get pushed into the water when other robots are present.

In deciding where to move, it considers five types of target tiles:

  1.  possible package location
  2.  intact home base (none of its packages picked up yet)
  3.  definite package location
  4.  destination of package other than first carried
  5.  destination of first package carried

Each kind of target has a fixed priority factor which is multiplied by
the distance (i.e., path length) to the closest target of that kind.
The behavior is not always optimal, but it should at least be reasonable.
