This python program resolves and analyzes two toy problems of constraint programming, Map Coloring and n-Queens,
with Min Conflicts Heuristic, that chooses a greedy move in every step, based on variable conflicts number.
Program is divided in two parts: Map Coloring files and n-Queens files. In every directory there are 3 type of python file,
one that contains function and classes used, one contains tests (that produce also graphics) and a demo file with we
can try examples and visualize them (thanks to graphic functions).
Not standard libraries used:
- networkx
- matplotlib
- scipy
- Russell-Norvig, Artificial Intelligence: A Modern Approach, Third Edition, Pearson.
- Stack Overflow.