= Hill climbing
A <local search> method that retains one current candidate and repeatedly chooses an improving neighbor of its objective. For a conflict-minimization <constraint satisfaction problem>, a candidate can assign all variables within their <constraint domains> while violating some inter-variable constraints; the objective counts those violations. Zero conflicts certifies a solution, while a positive-conflict <local minimum> need not certify impossibility. Plateaus and local minima motivate sideways moves, randomized choices and restarting. Prescribed variables must remain fixed in every initialization and move.
Back to article page
