Randomized Greedy Local Search: GSAT
Randomized Greedy Local Search: GSAT
Begin with a random truth assignment.
Flip the value assigned to the variable that yields greatest number of satisfied clauses.
Repeat until a model is found, or have performed specified maximum number of flips.
If model is still not found, repeat entire process, starting from different random assignment.
(Selman, Levesque, and Mitchell 1992)