On each step, with probability p, do a greedy GSAT move.
With probability 1-p, ``walk'' (flip a variable in an unsatisfied clause).
Even faster for many problems (like planning).
This is the best search algorithm known for random CNF sentences, as well as a large number of problems that can be transformed into CNF. And it's so simple!
