Solved at Scale
A Bigger Constraint Puzzle
Four nurses, three days, and three shifts form a thirty-six-boolean feasibility model with three constraint families. The instance is parsed from the real model file the external solver reads; no solving happens yet.
The puzzle
There are 4 nurses, 3 days, and 3 shifts per day, and one boolean per nurse-day-shift combination: 36 booleans in total. Why: the earlier chapters' chain had 3 variables with 3 candidate values each; this instance is the real model the external solver reads, parsed from its model file at build time, not hand-typed into the lesson.
Three constraint families
Coverage: each day-shift pair is worked by exactly one nurse, 9 rules. At most one: each nurse works at most one shift per day, 12 rules. Load: each nurse works 2 to 3 shifts in total, 4 rules. Why: these are the same kind of local rules as the precedence chain, but there are 25 of them over a much larger space.
No solving yet
This lesson only presents the instance. Why: the question is pure feasibility — find one assignment of nurses to shifts that satisfies every rule — and the solving, with its certificate, comes next.
Diagram note
The table lists the parsed dimensions and the three constraint families with their counts; those labels are the vocabulary this chapter uses everywhere. Pixel positions are rounded for layout; every number shown is exact.