# All Classes

Class Summary
Class | Description
--- | ---
Constraint | A constraint specifies requirements that any solution to the problem must meet.
Domain | A domain is the set of values that a variable might possibly be assigned.
EqualsConstraint | Constrains two variables to have the same value.
Main | Solves a given constraint satisfaction problem and prints out information about how much work was done to reach the solution.
MapColoring | Models the problem of coloring a map so that no two adjacent regions have the same color.
NotEqualsConstraint | Constrains two variables to have different values.
Problem | A constraint satisfaction problem is composed of variables (each with a set of potential values called a domain) and constraints on the values those variable can be assigned.
Problems | A set of example constraint satisfaction problems to solve.
Solution | A solution to a constraint satisfaction problem is an assignment of values to the problem's variables.
Solver | Provides the constraint propagation and search algorithms used to solve constraint satisfaction problems.
Sudoku | Models a Sudoku puzzle as a constraint satisfaction problem.
Variable | A variable can be assigned one of several possible values.