Reply To: Optimising a stochastic hill climbing attack?
Check out the Simulated Annealing page on Wikipedia. Adopting this refinement allows the search to skip to nearby hills more readily while the ‘temperature’ is higher, less readily as it ‘cools down’. I find that this increases the success factor substantially, usually reaching the desired result in 1500 – 2000 iterations.