GSAT ( greedy sat ) was the first local search algorithm for satisfiability .
Is a form of hill climbing .
GSAT ( greedy sat ) was the first local search algorithm for satisfiability , and is a form of hill climbing .