Anonymous user
Talk:Evolutionary algorithm: Difference between revisions
m
→How to make the algorithm scalable for larger target phrases?
Line 151:
:::: You guys are amazing. You're right - I changed the MUTATE rate and the COPIES to 100 and even with 1000 characters I always get to the target in less than 10,000 iterations (sometimes as low as 5000).
:::: I need a bit of time to get my head around the maths.
:::: I added the following because I was getting the same random sequence every time. Not sure if there's a more efficient way to do that... <code>srand ( time(NULL) );</code> and included <time.h>
:::: Thank you --[[User:Davidj|Davidj]] 18:45, 11 October 2011 (UTC)
| |||