Analysis updated 2026-07-18 · repo last pushed 2015-12-18
Run the map-coloring example to see how a constraint satisfaction solver assigns colors to regions.
Study the algorithm as a learning example before building your own scheduling or timetable solver.
Adapt the graph-based approach to model a different constraint problem, like Sudoku.
| rajprateek/csp_project | 0verflowme/learnings | 0verflowme/r2ai | |
|---|---|---|---|
| Language | Python | Python | Python |
| Last pushed | 2015-12-18 | 2022-06-18 | 2025-11-19 |
| Maintenance | Dormant | Dormant | Quiet |
| Setup difficulty | easy | easy | moderate |
| Complexity | 2/5 | 1/5 | 3/5 |
| Audience | researcher | researcher | developer |
Figures from each repo's GitHub metadata at analysis time.
README doesn't detail the exact algorithm (backtracking vs. constraint propagation), read the code for specifics.
A Python solver for constraint satisfaction problems, demonstrated on the classic Australia map-coloring puzzle where neighboring regions can't share a color.
Mainly Python. The stack also includes Python.
Dormant — no commits in 2+ years (last push 2015-12-18).
License is not stated in the available content.
Setup difficulty is rated easy, with roughly 30min to a first successful run.
Mainly researcher.
This repo across BitVibe Labs
Verify against the repo before relying on details.