Skip to content

AIMA3e CSP Package

Rüdiger Lunde edited this page May 25, 2019 · 10 revisions

About the design of the CSP package

A Constraint Satisfaction Problem (CSP) consists of Variables, corresponding Domains, and Constraints imposing restrictions to legal combinations of values. A solution is an Assignment, which satisfies all constraints.

The following UML class diagram gives an overview of the AIMA3e CSP implementation:

Class Diagram CSP package

Most classes and interfaces are generic. They use type parameters for the types to represent variables VAR and values VAL. VAR must be bound to a subclass of Variable to make sure that all variables have a name.

See MapColoringCspDemo to see how to plug all elements together.

Clone this wiki locally