This player is written in bigFORTH, a fast native code Forth.

The basic algorithm is a flood fill. This is used to determine
possible shortest pathes. The goal is to first find a home base, then
to deliver as many packages as possible, and when all known packages
are exhausted, find a new home base.

Fights are somewhat avoided, except if the enemy is in the way. A
random bidding and enemy avoidance component is used to reduce boring
loops (however, not completely successfully).

The program is called busy-bee, because it's just like a bee that
seeks for honey, and doesn't sting if not necessary.

The busy-bee.fi is the program image, which is started by busy-bee,
and has to reside in the same directory.
