Constraint satisfaction problems or CSPs are mathematical problems whose state must satisfy a number of Constraints. This consists Domains and Variables.
Constraints :
- A given subjects can be assigned only to one of the possible time slots given for that subject.
- Two compulsory subjects cannot be in the same time slot (optional subjects may).
- Two subjects cannot be assigned to the same room if they are assigned to the same time slot
Variables:
- Subs
- Types
- Sots
- Rooms
- Assignments
Domains:
- Assignments
- Rooms
- Subs