This code is written in Python and uses a genetic algorithm as well as 
Dijkstra's shortest weighted path algorithm.  Unfortunately, I was part of an 
OCAML team that fell apart, and I only had about 1 1/2 days to work on this, by
myself.  Hence, here's what's good about this program:

	o It works until you hit a base.
	o The genetic algorithm works perfectly and may be tested separately.
	o The code is pristine, well commented, and occasionally surprising.
	  It's my hope that my commitment to code style will give me some 
	  brownie points ;)

Author: Shannon -jj Behrens
