Binary constraint sat is fact ion problems involve f ind ing values for variables subject to constraints between pairs of variables. A lgo r i t hms that take advantage of the st ructure of constra int connections can be more efficient than simple backtrack search. Some pairs of variables may have no direct constraint between them, even if they are l inked ind i rect ly th rough a chain of cons...
