Constraint Propagation on a 100-node graph coloring problem

Animation by Andrew Moore

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

Back to other constraint satisfaction animations