ICFP 2002 entry written in Erlang

	Bagirath Krishnamachari (bagirath_r_k@hotmail.com)

The program is written with very naive heuristics and hence does not play 
aggressively. In fact it always bids a constant value (1), does not push
other bots and has not been tested on any configurations save the ones on
the contest web page. 

The program maintains the following data

1. Board details in a digraph. In the digraph, there are edges only between
safe squares or between a safe square and a home base. Hence even an 
accidental move into water or into a wall is not possible. 

There is an added advantage that the digraph module in Erlang's stdlib has
functions like get_short_path which do away with the need for writing
graph/tree traversal code. 

2. Details of home base locations, packages and other bots are maintained in 
ETS tables.

The algorithm is as follows

1. See if you're on a destination board for one or more of your packages and
if yes, drop it/them.
2. Else, see if you can still pick up any more packages (Assuming there are
some in your current location). If yes, pick the "best" ones. The best ones
are identified by calculating 45*weight/(weight+dist to destination) for 
each package and taking the ones with the highest values. 
3. Else, see if you can move in a direction so that you can deliver one or
more of you packages (Assuming that you do have at least one package)
4. Else, get to the nearest home base (This will usually be the case
when you're not carrying any packages and your current location is empty).

Lots of error cases have not been handled.
