Modify the assignment by either choosing a neighboring assignment that modifies an evaluation function, or making a random choice of move Modify the assignment in two steps - first choose a variable to change, then choose a value for it. 1. Any Conflict Algorithm 2. Iterative Best Improvement Select a variable in a conflict at random and change it. Algorithm Most Improving Step Algorithm Simulated Annealing Algorithm Two-Stage Choice Algorithm 3. Pick a variable at random, then a value at random. If the ensuing assignment is better, accept it. It if is not, accept it with some probability (where the probability of accepting a worse assignment decreases over time.) 4. 5. Modify the assignment by choosing a neighboring assignment that optimizes an evaluation function Modify the assignment by either choosing a neighboring assignment that modifies an evaluation function, or making a random choice of move Modify the assignment in two steps - first choose a variable to change, then choose a value for it. 1. Any Conflict Algorithm 2. Iterative Best Improvement Select a variable in a conflict at random and change it. Algorithm Most Improving Step Algorithm Simulated Annealing Algorithm Two-Stage Choice Algorithm 3. Pick a variable at random, then a value at random. If the ensuing assignment is better, accept it. It if is not, accept it with some probability (where the probability of accepting a worse assignment decreases over time.) 4. 5. Modify the assignment by choosing a neighboring assignment that optimizes an evaluation function