Hi!

This is my first ML program and I come from an imperative 
backgound, so there's little chance you'll enjoy browsing the
code :) Anyway, my strategy was to simply divise the map into rectangular zones
wich had connections from one to the other. This simplify the shortest
path search a bit, although I didn't have much time to finish it (I had
long non-computer nights this weekend). There's no biding and pushing
logic at all.

Thanks for this interesting contest !