Constraint Programming is a vast subject area in AI and Operations Research. Some well-known Constraint Satisfaction Problems (CSP) are Sudoku, N-Queens, Map Coloring, Scheduling (of many kinds, e.g. classrooms-to-courses). In general, CSP are NP-hard but many techniques/algorithms have emerged to … Continue reading →