Recently, I also wrote (C#) a string evolver using a GA: https://github.com/dreasgrech/StringEvolver https://github.com/dreasgrech/StringEvolver I tried 3 diff

Recently, I also wrote (C#) a string evolver using a GA: https://github.com/dreasgrech/StringEvolver https://github.com/dreasgrech/StringEvolver I tried 3 different types of fitness functions: Per-Character error summation, Levenshtein Distance and Hamming Distance. I found that Hamming Distance produced the quickest convergences. The code for my project is "fully OOP" so you can switch implementations for crossover, mutation and selection operators and also for the fitness functions. Go ahead, fork me ;-)