An external CP-SAT solver solves the pinned fifty-item instance under deterministic parameters. The diagram highlights exactly the items decoded from the run's own solution values, displayed as decoded.
highlighted = computed this step
Invocation
The invocation is cpsat_stream_solve solve knapsack.jsonl --params num_search_workers:1,random_seed:1, with the solution values written to a temporary --sol file. Why: a single search worker and a fixed seed make the run deterministic, so the selection quoted below is reproducible rather than anecdotal.
one worker, one seed, deterministic solve
The solver's result
The solver reports status OPTIMAL with objective value 7534. Why: OPTIMAL means the solver proved a matching bound, not merely found a good packing; the objective is the deterministic field this lesson quotes, not timing or search statistics.
status OPTIMAL, objective=7534
The chosen items
The solver chose 32 of the fifty items, decoded from its own solution values. Why: the highlighted cells in the diagram are exactly those thirty-two items — the same decode that fed the weight and value checks, not a separately authored selection.
chosen items=32
Diagram note
Highlighted cells are the solver's own decoded selection, marked by role with a starred label, not a color-only marker. The cell entries are the original exact weights and values. Pixel positions are rounded for layout; every number shown is exact.