The Modified Bit Climber

• Generate and evaluate a random bit string

• Do until stopping criteria satisfied:

  • Randomly select a bit position, k
  • Randomly generate p from 0..1
  • If p < probability of flipping bit k:
    • Flip the k’th bit
    • Evaluate the new string
    • If fitness is worse, unflip the bit
  • If count exceeds a threshhold, rerandomize the string

• Avoids making large changes to the bit string

• Worked much better than standard bit climber for this particular problem

Previous slide

Next slide

Back to first slide

View graphic version