* ga.lisp:   Made sure that find-fitnesses actually does that for all chromosomes.  This was done by making it use a list instead of maphashing or looping over the hash-table.  There must be something wrong with the hash-table implementation.   I've moved everything over to a list-format and am not using hash-tables at all.  This is more the lisp way and it makes recursion much easier.  Also, I do not notice a slowdown in the code at all.   Make mutation actually recursive using the knowledge used in the recursive crossover function.
* ga.lisp:
  Made sure that find-fitnesses actually does that for all chromosomes.  This was done by making it use a list instead of maphashing or looping over the hash-table.  There must be something wrong with the hash-table implementation.
  I've moved everything over to a list-format and am not using hash-tables at all.  This is more the lisp way and it makes recursion much easier.  Also, I do not notice a slowdown in the code at all.
  Make mutation actually recursive using the knowledge used in the recursive crossover function.

ravster/pleasance,ravster/pleasance,ravster/pleasance,ravster/pleasance,ravster/pleasance