This is to announce the publication of CSP-Rules-V2.1
CSP-Rules is a general pattern-based (or rule-based) solver of finite binary Constraint Satisfaction Problems.
V2.1 is the first public release.
CSP-Rules is inherently associated with the approach to CSP solving defined and largely illustrated in my book “Pattern-Based Constraint Satisfaction and Logic Puzzles” (PBCS).
A priori, CSP-Rules deals only with binary constraints, but the applications studied in [PBCS] and included in the CSP-Rules-V2.1 package (namely: solvers for Latin Squares, Sudoku, Futoshiki, Kakuro, Map Colouring, Numbrix, Hidato and Slithering) show that many types of non-binary constraints can be efficiently transformed into binary ones by adding problem-specific CSP-Variables, thus making them amenable to the CSP-Rules treatment.
Both the oldest and the current implementations of CSP-Rules are based on CLIPS.