Revision Complex

This is a basic genetic algorithm that will solve for the input string you enter. Click the "Start finding" button to have the algorithm begin solving for the input text. The alogrithm starts by seeding random ACSII characters into 20 strings with the length equal to the input. From there it takes some of the output strings and "mates" them with each other to produce new strings, replacing old strings. There is a percent chance that each string will have a "mutation", where a character within the string will become a new random ASCII character. This mutation allows genetic variety to continue to exist and eventually leads to the children having a chance to have a closer string to what it is searching for.

The value of each string is evaluated by measuring the difference of the ASCII character code at each position to the input character code at the same position. Each generation, a cumulative "fitness" is assigned to the string based on the evaluation measure and the strings are sorted by the fitness. The strings with the best fitness are moved to the top and are used as "parents" to make children for the next generation.