I think this is pretty good work by user:MFNickster. Though perhaps we ought to explain some more of it in our own words rather than Dawkins, wondered what you guys thought. Dunc| ☺ 10:58, 11 Jun 2005 (UTC)
Create a random population of n members Base score is zero For each member in population Compute score equal to total character/position matches If score improvement Store member and its score as best match For each successive generation If exact match found, exit loop For each member of a random (1/8 population) sample Copy a random sub-string from best match into member Compute new score If score improvement Store member and its score as next generation's best match For each member of a random (1/8 population) sample Mutate one character of member Compute new score If score improvement Store member and its score as next generation's best match List the results
I think this is pretty good work by user:MFNickster. Though perhaps we ought to explain some more of it in our own words rather than Dawkins, wondered what you guys thought. Dunc| ☺ 10:58, 11 Jun 2005 (UTC)
Create a random population of n members Base score is zero For each member in population Compute score equal to total character/position matches If score improvement Store member and its score as best match For each successive generation If exact match found, exit loop For each member of a random (1/8 population) sample Copy a random sub-string from best match into member Compute new score If score improvement Store member and its score as next generation's best match For each member of a random (1/8 population) sample Mutate one character of member Compute new score If score improvement Store member and its score as next generation's best match List the results