Nature of Code 9.01 - Shakespeare Example: Contribution/Question

Contribution:
A Java version of the Shakespeare Genetic Algorithm Challenge:

[https://github.com/BartholemeuChamberlain/Shakespeare-Genetic-Algorithm](url)

I added a piece of functionality to the DNA's ability to retain correct answers, specifically in the Mutation function. After converting from the Processing language to Java, I noticed that the program was not evolving after thousands of generations. Debugging through the DNA code, I noticed that the Mutation function was doing its job TOO well. This function was replacing the correct answers that the system was guessing. So I added the functionality that would skip the correct characters and only mutate the wrong answers (still based on the mutation rate). After this change, the system was able to get the correct answer in approx. 80 generations

Question:
Does this adjustment still follow proper Genetic Algorithm principles,? If not what adjustment should I have considered before this change?

- Thanks!

Beginne mit der Überprüfung der verlinkten Java Shakespeare Genetic Algorithm-Implementierung, insbesondere der DNA Mutation-Funktion, und vergleiche ihr Verhalten mit der in der issue beschriebenen Processing-Version. Bestimme, ob das Überspringen bereits korrekter Zeichen weiterhin mit den Prinzipien genetischer Algorithmen vereinbar ist; abgeschlossen ist die Aufgabe, wenn eine klare Antwort oder eine empfohlene Anpassung vorliegt.

Vom Indexierungsmodell aus dem Issue-Text verfasst.