
This is Zol by team Tycon Mismatch.

Our robot develops a plan (essentially, a destination) then calculates
a "distance" to every square on the map on each turn. These distances
depend on the actual walking distance as well as the presence of enemy
robots. Then he (usually) takes the shortest route to his destination.
When arriving on a square with packages, he picks up some of them
using a heuristic (which attempts to approximate a knapsack problem
solver) and then heads off to deliver the closest one.

He has some code for detecting danger situations and trying to
outbid or outmaneuver the enemy. He also takes an opportunity
to dunk a competitor deliverybot if such a chance arises.

Zol is written in SML (with a small C library for sockets) and
compiled with the MLton compiler.

Some people who worked on this (to varying degrees..!):
     Tom Murphy
     Dave Charlton
     Kaustuv Chaudhuri
     Adam Goode
     Adam Chipala
     Jason Reed
