Anonymous user
Talk:Evolutionary algorithm: Difference between revisions
→"Official" Algorithm
(→Are the Python and C++ solution cheating?: the first python code does look like it, though not intentionally) |
|||
Line 118:
Also just want to flag that I'm making two minor changes to the C program. I'm removing the hardcoded "27" (number of characters A..Z) from a couple of formulas and introducing a constant called POSSIBILITIES that is calculated from the number of characters that are possible. Also doing a cast to INT in two places because of a type compile error. --[[User:Davidj|Davidj]] 18:54, 1 October 2011 (UTC)
:# I don't know any evidence that Dawkins has anything to do with this task;
- this algorithm was described by Dawkins in his book "The Blind Watchmaker" - http://en.wikipedia.org/wiki/Weasel_program . The Wiki page states that "Dawkins did not provide the source code for his program, a "Weasel" style algorithm could run as follows...". I think that this question has been answered. A little strange that the original source code was not provided but I'm sure he had his reasons. Should I now remove this section? --[[User:Davidj|Davidj]] 19:29, 3 October 2011 (UTC)
:# I removed most of the string length references in the code. --[[User:Ledrug|Ledrug]] 01:33, 2 October 2011 (UTC)
:Thank Ledrug, the code looks great. I've had fun running it with larger target phrases & other variations. Thanks. --[[User:Davidj|Davidj]] 19:29, 3 October 2011 (UTC)
| |||