Name: Trevor Clarke
Email: retrev@csh.rit.edu

My program is basically a genetic algorithm that searches the possible solution
set. It is a fairly standard GA with a couple of specialized mutation types.
After the GA runs, the winning string is passed to a simple filter. The filter
removes "nowhere" move combinations such as NS. It also simplifies the string
to "lowest terms." Example: the string EEESEEES simplifies to EEES, and the
string EEEE simplifies to E. More information can be found in code comments.