Editing Constraint programming (section)

=== Local Search ===
{{Main|Local search (constraint satisfaction)}}
'''Local search''' is an incomplete method for finding a solution to a [[Constraint satisfaction problem|problem]]. It is based on iteratively improving an assignment of the variables until all constraints are satisfied. In particular, local search algorithms typically modify the value of a variable in an assignment at each step. The new assignment is close to the previous one in the space of assignment, hence the name ''local search''.