Here is my bot program. It's written all in Java and the source is UGLY! The approach I took for develop this bot was to reason that you earn points for delivery of packages, not by preventing others from scoring. My bot will try to expedite packages as efficiently as possible, but if it encounters another bot in its way, it will run away. 

Most of the development effort focused on solving some bin-packing issues which I believe to be the only clever aspect of my bot. I first compose all available packages into "groups". These groups can consist of one or more packages that have the same destination. I then talley up the gain for delivering that group (weight divided by distance) and sort the list of groups in order of most gain to least gain. I don't think it is the greatest solution, but it is a "good" solution that computes fairly quickly. 

Another mild achievement would be the pathfinding algorithm which is really just a modified dykstra's. I just simplified it for this special case. THe only other claim to fame for this bot program (so far) is that it can handle the largest maps with the most packages very efficiently. I have a map that is 1,000 x 1000 and holds 10,000 packages, gives a million money to each bot and puts all the packages on one side of the map, their destinations all on the other and my bot still calculated the shortest path in under a short amount of time and was able to way outpace the server. In fact, I placed all the packages on that board with an average CPU time of less than 100 ms a round. Something I've noticed is that when I do handle these large files, I need a substantial amount of memory. I hope that if you are going to test these bots on boards that are bigger than 1000 x 1000 that you not enforce your 64 Meg memroy restriction.

Anyways, thanks for hosting the contest. I enjoyed it. 

Jason Judt