These animations illustrate algorithms explained and discussed in Andrew's Lecture on Constraint Satisfaction

- Depth First Search on a 9-node graph coloring problem
- Backtracking on a 9-node graph coloring problem
- Backtracking on a 27-node graph coloring problem
- Forward Checking on a 27-node graph coloring problem
- Constraint Propagation on a 27-node graph coloring problem
- Forward Checking on a 49-node graph coloring problem
- Constraint Propagation on a 49-node graph coloring problem
- Constraint Propagation on a 196-node graph coloring problem
- Constraint Propagation with Variable Ordering on a 196-node graph coloring problem
- Depth First Search on a 100-node graph coloring problem
- Backtracking on a 100-node graph coloring problem
- Forward Checking on a 100-node graph coloring problem
- Constraint Propagation on a 100-node graph coloring problem