Academic project developed for the Artificial Intelligence course, focused on modeling and solving Constraint Satisfaction Problems (CSPs) using the Choco Solver.
This project explores how to represent and solve CSPs through constraint programming techniques. Different classical problems are modeled and solved using the Choco Solver library in Java.
- Constraint Design
- Map Coloring
- N-Queens
Each problem is modeled as a CSP and solved using constraints, variables, and search strategies.
progettoCSP/
│
├── code/
│ ├── chocoCode/
│ │ ├── ConstraintDesign/
│ │ ├── MapColoring/
│ │ └── NQueens/
│ └── choco-solver.jar
│
├── presentation/
│ └── Slides and material for oral presentation (only slides are available)
│
├── relation/
│ └── Project report (only images are available)
│
└── .vscode/
└── Editor configuration files
- Java
- Choco Solver (Constraint Programming library)
-
Clone the repository:
git clone https://github.com/esignor/CSPs-Choco.git -
Open the project in your preferred IDE (e.g., VS Code, IntelliJ).
-
Ensure the
choco-solver.jaris included in the project dependencies. -
Run the desired problem from the
chocoCodedirectory.
- The full project report is available in the
relation/folder. - Presentation slides are available in the
presentation/folder.
This repository is provided for educational and reference purposes only.
- The content of this repository must not be copied or reused in whole or in part for academic submissions (e.g., presenting it as your own project).
- Redistribution or reuse of the material without proper attribution is not allowed.
📌 Attribution Requirement:
If you use any part of this work (code, report, or presentation), you must clearly cite:
- The author (Eleonora Signor)
- This repository as the original source
Eleonora Signor
Master’s Degree in Computer Science University of Padua
2020/2021