Team: Cube
Members: Sketch (sketch@smail.info), IxChel(ixchelchen@yahoo.com)
Program Name: Bad Robot
Language: C++

Details:
Uses a grid-based-graph shortest path algorithm.  After reading in the board, it builds
a set of rectangular passable areas and connects the adjacent rectangles to form
a graph and traverses the graph (Depth First Search), so it doesn't always get the
shortest path, just a path, if possible.  Could be modified to do a BFS, but there 
wasn't enough time to correctly implement it.

It is not a 'rude' robot in terms of being nasty and trying to push other robots into
water or off home bases, etc.  It uses a greedy algorithm for package pickup/dropping
optimized for weight.  It could be changed to optimize by package destination, but there
wasn't enough time.


TODO:
Recognize 'rude' robots and compensate by finding another base, if possible.
Get a better shortest path algorithm.
Modified bidding based on circumstances (it currently always bids 1 unit of money).

