oldmanintheskydidntdoit
Posts: 4999 Joined: July 2006

We has chart. http://complexspecifiedinformation.appspot.com/chart......t....rt
Quote  My understanding is the fitness score for a 500 bit child is the product of the lengths of runs of ones. 
I have not been following the discussion closely. It's an attempt at the pseudo described in the OP in the link above to TSZ
Quote  My understanding is the fitness score for a 500 bit child is the product of the lengths of runs of ones. 
This is the fitness code:
Code Sample  for toss in r: if toss == 'H': # As they do so, they record all runs of heads counter+=1 if toss == 'T': # so that if they toss H T T H H H T H T T H H H H T T T, if counter > 0: # they will record: 1, 3, 1, 4, representing the number of heads in each run. score.append(counter) counter = 0 round_score.append(score) 
So given a string of heads and tails like so:
H,H,T,H,H,H,T,H,H
The score calculated would be
2,3,2
And then the product of that list would be the score, 12 in this example.
If there is now an alternative model being used, the bitstring length of 1's you mention, could you link me to the original description?
Or have I totally misunderstood this: ? Always possible!
 I also mentioned that He'd have to give me a thorough explanation as to *why* I must "eat human babies". FTK
if there are even critical flaws in Gaugers work, the evo mat narrative cannot stand Gordon Mullings
