Forward Checking on a 100-node graph coloring problem

Animation by Andrew Moore

Click here to download AVI movie

The FORWARD CHECKING 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.

In this case it does just as miserably as Backtracking.

See Constraint Satisfaction Lecture notes at
http://www.cs.cmu.edu/~awm/tutorials/constraint.html