Skip to content

Latest commit

 

History

History
3 lines (3 loc) · 285 Bytes

README.md

File metadata and controls

3 lines (3 loc) · 285 Bytes

Solving a graph coloring problem using CSP💡

Constraint satisfaction problems (CSPs) are mathematical questions defined as a set of objects whose state must satisfy a number of constraints or limitations. From the course "Introduction to Artificial Intelligence and Data Science".