Constraint-Satisfaction-Problem

The assignment problem relates to the understanding of the Constraint Satisfaction Problem in the field of Artificial Intelligence. The solution uses Backtracking with heuristics to make the code faster and better.

The heuristics include:

1. Minimum Remaining Values
2. Least Constrainig Values
3. Forward Checking (AC3)

All these heuristics make the solution faster for large inputs.

PROBLEM STATEMENT

CONSTRAINTS GIVEN

AN EXAMPLE

SOLUTION

INPUT FILE FORMAT

OUTPUT FILE FORMAT

FILES

csp.py- The backtracking algorithm with heuristics
hw2.pdf - The assignment problem