It&#x27;s not clear to me what this does, or if it&#x27;s useful. You have a fixed-length vector of strings and you make cross-overs between elements in the vector based on non-uniform random distributions. That is to give more chances to younger offspring to procreate. Then you apparently remove the oldest (i.e. first) strings in the vector, and replace them by appending offspring. But then you also mention you are not deleting older organisms. I&#x27;m a bit confused.<p>I think it&#x27;s wrong to say you don&#x27;t have a fitness function. Your fitness function is &quot;Is this string a password?&quot; and the score is binary. Why do you say there is no fitness function?<p>Also, in your examples, is &quot;aaaaaaaaaaaaaaaa&quot; really a password?