# Genetic.tex

The representation of genetic algorithms is a nontrivial problem.\cite{Rothlauf} Each solution in $[3]^n$ was represented as an array of $3^n$ elements where each element was a 0,1 or 2. This was generalized to higher dimensional versions of the problem. We depart from the traditonal genetic algorithm, in that, the genetic algorithm implemented is a mixture of both a greedy algorithm and a genetic algorithm. This combination of greedy and genetic algorithms, which has some precedent\cite{Krisha}, was observed to increase the effectiveness of the genetic algorithm solution of the Hales-Jewett problem significantly.