Click here to download AVI movie

The CONSTRAINT PROPAGATION algorithm on a 3-color graph-coloring problem with 100 nodes. Tries BLUE then RED then BLACK. Little dots denote the availability lists for the nodes. It does incredibly well. After two steps, CP realizes that all the other values are now uniquely determined. See Constraint Satisfaction Lecture notes at http://www.cs.cmu.edu/~awm/tutorials/constraint.htmlBack to other constraint satisfaction animations