Algorithm

procedure hill_climb

restart: set s to a randomly selected initial state;

for j:=1 to max-flips do

if s is a solution then return s;

else if s is a strict local-minimum then goto restart;

else s:= a neighbor that has the best evaluation value

(ties are broken in deterministic, unfair way)

end if; end if; end;

goto restart;

Prev

Next

Top

With Graphics