PCP is a library to model constraint satisfaction problems (CSPs) in the constraint programming paradigm. Constraint programming is a paradigm for expressing problems in terms of mathematical ...
AI constraint solver in Java to optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems. The open source ...
Sudoku puzzles form perfect constraint satisfaction problems (CSPs), with a goal of populating a 9x9 grid with 1 through 9, with compliance with specific constraints for rows, columns, and 3x3 blocks.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results