COMPILATION
-----------
I tested on FreeBSD 4.4 (gcc) and with cygwin.
I have no linux machines available to try compilation there.
It should not give a problem, it is all C and posix.

ALGORITHM
---------
This submission has a long-term strategy and a short-term strategy.

The long-term strategy determines the next location to travel to.
Either to pick up a package, or to deliver one. The next location
is determined using a monte-carlo simulation. It generates game
continuations at random and scores each (biassing towards short-term
gains). The first step from the best out of 10000 simulations is selected.

The short-term strategy is responsible for moving the robot to
its next target location. It simply uses a shortest path algorithm.
Whener there are enemy robots nearby, it tries to avoid them,
especially near water. (so it is not a killer)

The long-term target is recomputed every time a package is picked
(by any robot in the field), or when the robot reaches its next
target location.

The robot keeps track of all packages it has seen, but forgets
about any package that another robot has picked up.

