Artem Dmytrenko's entry to ICFP Programming contest.

Short description of the algorithm:

	1) Select destination:
		a) Homebase
		b) Destination
	
	2) Select Threats (incomplete implementation)
		a) Other bots that are too close
		b) Water
		c) Homebases if:
			I)   Known Empty
			II)  Other bots are around and we're not empty
			III) If we're full
	
	3) Select Treats
		a) Homebases if we're empty 
		b) Dropped packaes if we're empty
		c) Package destinations


Extra features:
	1) Shortest path locator (concetrate on delivery)
	2) Kill nearby bots if we can
	3) Kill ourselves if packages are unreachable

Everything is written in C.