Before revision:  Next we consider the complexity of local search on fitness landscapes modelled by valued constraints with restricted forms of constraint graph .
After revision:  We then develop several techniques to bound the length of any sequence of local search moves. We show that such a bound can be obtained from the numerical values of the constraints in the representation, and show how this bound may be tightened by considering equivalent representations .