Summary

In this chapter, we've had our first look at the genetic algorithm. We discussed the general operation of the algorithm and a saw sample run through the algorithm to demonstrate initialization, fitness evaluation, selection, and recombination. We then discussed source code that implements an evolver for instruction sequences and looked at some of the sample equations that were solved with it. Since the GA knows nothing about the equations themselves , only if it's correct in solving them, the GA provides alternate solutions to the problem (within the defined instruction set) that demonstrated an optimization of the actual algorithm. Finally, we discussed the parameters that can be tweaked for the genetic algorithm and some of the problems that the algorithm presents .