| input: Problem in CNF format |
| output: Number of satisfied clauses |
| (1) begin |
| (2) for to MAX-TRIES do |
| (3) T Random-Assignment(); |
| (4) for to MAX-FLIPS do |
| (5) Random-Unsatisfied-Clause(); |
| (6) if (∃variable with breakcount = 0) then Chosen-Variable ; |
| (7) else if (random(0,1) ) then |
| (8) Chosen-Variable Random-Variable; |
| (9) else |
| (10) Chosen-Variable Random-Lowest-Break count; |
| (11) end |
| (12) end |
| (13) end |
| (14) end |