#local-search

A SAT formula over $a, b, c, d$ has six clauses: $(a \lor \lnot b)$, $(\lnot a \lor b \lor c)$, $(\lnot c \lor d)$, $(d)$, $(\lnot a \lor b \lor d)$, $(\lnot a \lor \lnot d)$. A state is a bit string $abcd$, its neighbours flip exactly one bit, and $h$ is the number of satisfied clauses. Steepest-ascent hill climbing starts at $1010$ and stops when no neighbour has a higher $h$. Where does it stop?