An Introduction to Constraint Programming
summary
Shows declarative constraint models that solve the crypto puzzle SEND+MORE=MONEY (one unique solution) using the Java/Groovy library Choco and visualizes search with CP‑Viz, compares brute‑force permutations to pruning+branching, and demonstrates other worked cases: Frobenius/McNuggets (largest unreachable = 43), and a diet cost minimization using integer scaling with Choco, OptaPlanner and Apache Commons Math; all examples run from the repo and do produce concrete solutions.
AI-written summary · about
chapters (10)
- 0:00Introduction to constraint programming
- 3:52What is constraint programming
- 11:56Cryptoarithmetic problem demo
- 15:13Constraint programming with Choco
- 20:11How solvers prune search space
- 33:13Examples in multiple languages
- 34:17Frobenius numbers problem
- 37:26Linear programming overview
- 40:13Solving with spreadsheets
- 47:26Summary and key takeaways
related talks
01h 02mLogic, Optimization, and Constraint Programming: A Fruitful Collaboration
34mSolving Problems Declaratively
19mA Constraint Solving Approach to Parikh Images of Regular Languages
35mA Peek Inside SAT Solvers
30mProof Logging for Constraint Programming
33mSolving constraints during type inference
18mAutomated Catamorphism Synthesis for Solving Constrained Horn Clauses over Algebraic(…)
28mScimitar: Functional Programs as Optimization Problems