Skip to content

EasyCSP is an open-source Java library for Constraint Satisfaction Programming. Supports CSPs, CSOPs, discrete object domains, int interval domains, int constraint binarization. Examples include NQueens, Sudoku. (Builds on Sourceforge)

License

Notifications You must be signed in to change notification settings

cordisvictor/easycsp-lib

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

EasyCSP is an open-source Java library for Constraint Satisfaction Programming.

EasyCSP is an open-source Java library for Constraint Satisfaction Programming.

EasyCSP offers search algorithms for both CSPs and CSOPs.

EasyCSP supports CSPs to be defined using objects or int expressions.

Dependencies

Requires Java 8 or later.

Release Notes

Release 1.3.1

  • refactored: Solution API and generics in general.
  • performance: avoid int-Integer autoboxing for int CSPs.
  • fix: int expression binarization issue.

Release 1.2.1

  • fix: ConflictMinimizing search algorithm bug.
  • feature: added full support (algorithms and API) for int specific CSPs and CSOPs.

Release 1.2.0

  • fix: IntDomain size() bug when containing both positive and negative ints.
  • feature: added int specific model classes, constraint expressions API and specialized search algorithm.

About

EasyCSP is an open-source Java library for Constraint Satisfaction Programming. Supports CSPs, CSOPs, discrete object domains, int interval domains, int constraint binarization. Examples include NQueens, Sudoku. (Builds on Sourceforge)

Topics

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages