Amirhossein-Rajabpour / Constraint-Satisfaction-Problems

Artificial Intelligence Course 3rd Project: Implementing CSP Backtracking, Forward Checking and MAC Algorithms in order to solve a binary puzzle

Constraint Satisfaction Problems

Artificial Intelligence Course 3rd Project: Implementing CSP Backtracking, Forward Checking and MAC Algorithms in order to solve a binary puzzle.

In this group project we (arminZolfaghari and Amirhossein-Rajabpour) solved a binary puzzle using CSP.

You can specify to use forward checking or MAC algorithm in main.py file.

Puzzle rules are as follows:

1. Number of 1's and 0's in each row and column must be equal
2. Each row and column must be unique
3. There should be no more than two duplicates in each row and column.

You can choose puzzle in main.py file and puzzle should be like sample input bellow

Sample input:

Sample output:

Check full description (in persian): here
Project report (in persian): here

Check our other AI Course projects:

• Project 1: Searching Algorithms (IDS, BBFS, A*)
• Project 2: Genetic-Algorithm
• Project 4: NLP Comment Filtering