The maintainer played several 3-player games on 2026-08-03 and could not
win any. This says why, from the engine's own constants rather than my
arithmetic: claim every Problem the deal puts in play, concede nothing,
and the total still falls short of GR-E01's threshold at 2, 3 and 4
seats.
2p: 2 problems worth 3 vs threshold 5 — UNREACHABLE
3p: 3 problems worth 6 vs threshold 7 — UNREACHABLE
4p: 3 problems worth 6 vs threshold 7 — UNREACHABLE
5p: 4 problems worth 10 vs threshold 9 — reachable
6p: 4 problems worth 10 vs threshold 9 — reachable
The test reads problem_priorities (GR-S01's deal) and threshold (GR-E01)
out of the engine, so it cannot drift from the rules it tests, and it
holds for either dataset -- the stand-in gives 3/6/10 and Problems.csv
gives 4/6/9 against the same 5/7/9.
It ASSERTS THE DEFECT and is expected to keep passing until ground-game
rules, then be inverted. This is CB-WP-0022's reproduction rule applied
before the register exists, because delivering feedback should not block
on building the tool that tracks it.
Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
tegwick
b513209acf