Problem with the “memory” technique
It gets stuck when the probabilities get too low
But, based on the probabilities, we can compute a mean and standard deviation for each gene representing the most likely change that would occur if we kept looking for a bit that we could flip.
In other words, we can simulate the modified bit climber using a simple statistical analysis.
This leads us to a much simpler, much faster algorithm that never gets stuck - a floating point, “bit” climber!