Constraint satisfaction
**Constraint satisfaction problems (CSPs)** assign values to variables under rules—scheduling, map coloring, configuration.
What it is
Constraint satisfaction problems (CSPs) assign values to variables under rules—scheduling, map coloring, configuration.
Why it matters
Many “planning” business problems are CSPs in disguise. Solvers and heuristics beat naive generate-and-test.
How it works (plain)
Variables, domains, constraints. Search with forward checking / propagation to prune impossible values early.
Everyday example
Assigning meeting rooms without double-booking.
Try it
Write 3 variables and 2 constraints for a weekend schedule.
Myths
- ⚠️ Myth: LLMs replace CSP solvers for hard schedules.
- ✓ Reality: Use LLMs to draft; use solvers/tools to enforce constraints.
Sources
- Course 06 search; Course 10 tool-use
- AIMA CSP chapters