Evolutionary based algorithm that grows to match a phrase given as input.
An individual is marked as a phrase the same length as the target one, formed randomly from ASCII characters and spaces. After every generation, the top 2 fittest individuals are picked and mated(by randomly choosing a crossover point and forming the children by cutting the strings at that point and joining them) and mutated with a probability(a letter is randomly modified).
The fitness function is the number of characters that are the same between the individual and the target phrase.
- Alexandru Meterez
This project is licensed under the MIT License.