M1 Artificial Intelligence · semester 7 · Choco
Choco
Eleven Caseine exercises in constraint programming, solved with pychoco: puzzles and combinatorial problems, from magic squares and N-queens to car sequencing and steel production.
Puzzles and combinatorial problems
01
Toy meeting
Scheduling a toy meeting under time and resource constraints.
02
Magic square
A magic square, filled so every row, column and diagonal matches.
03
ABCDE × 4
Finding digits A–E such that ABCDE × 4 = EDCBA.
04
Birthday puzzle
Guessing a birth year from a handful of clues.
05
Sujiko
A Sujiko puzzle: numbers placed in a grid to match the corner sums.
06
Heterosquare
A heterosquare puzzle, where every row, column and diagonal sum differs.
07
Magic series
A magic series, the self-referential counterpart to the magic square.
08
N-queens
The classic N-queens puzzle, placing queens so that none attacks another.
09
Warehouse location
The warehouse location problem: which warehouses to open to serve demand.
10
Car sequencing
Car sequencing on an assembly line, across several instance sizes.
11
Steel production
Steel production planning, across several instance sizes.
Reading it
Source
The folder on GitHub
Eleven exercise folders, each with its script and completed model once the work is done.
README
The course README
The full table of Choco exercises, what each is solved with, and what is provided going in.
The exercise statements are not redistributed here. Each exercise keeps its handout on disk, out of the repository; what is committed is my own work.