In other words, each position of a randomly chosen bit-string can be either a '0' or a '1' with probability 1/2.
the aim is to tune these position probabilities towards the best bit-string, with respect to some scoring function g. let the sentence have n words and let = n − 1 be the length of bit-strings.