Genetic Algorithms (GAs) are computational models
which simulate the behavior of natural systems, like biological reproductive
systems. Their structure is likened to Darwin's theory of Evolution, where
'survival of the fittest' in *candidate solution strings* takes over
and the best fit candidates dominate the population.

The example below is a Flash Actionscript3 driven GA designed for trigonometric curve fitting, given a data set the GA will start with a random set of candidate solutions and through the processes of selection, crossover and mutation the GA will find the candidate which best fits the data. Press the 'Start GA' button to begin.

The example below is a Flash Actionscript3 driven GA designed for trigonometric curve fitting, given a data set the GA will start with a random set of candidate solutions and through the processes of selection, crossover and mutation the GA will find the candidate which best fits the data. Press the 'Start GA' button to begin.