tegwick
2da19a49b7
ADR-0011 decided it: vendor the CSV with a checked digest, read it with a ~50-line reader, and let the hashes move. The declaration's constraint was measured against the WRONG BUDGET. It said a CSV crate costs 21,613 against AM-4a's 3,798 of headroom, '5.7x over, settled by measurement'. But setup and problem_priorities are cfg(scenarios) and are not in the shipped runtime at all, so AM-4a never sees them. Against AM-4b, csv costs 17,651 against 19,742 -- it FITS, with 2,091 to spare. It is refused anyway, on proportion: 89% of the budget's remaining capacity to read 20 rows. The revisit condition is stated (nested quoting, embedded newlines, multiple dialects). GR-S01 now deals Surface + hidden 1..=k as ruled, with edition values and suits. Measured: 6/9/12 available against thresholds 5/7/9 -- the game is winnable at every seat count, which is what the maintainer could not do. gd0001 is INVERTED, not deleted, and now also asserts the 6/9/12 so a deal that is reachable for the wrong reason still fails. Blast radius was scenario expectations, exactly as the ADR predicted: no scenario pinned a hash and no bundle is committed. Six scenarios and two unit tests updated, each with a note. gr-e01-threshold-unreachable-2p is RENAMED to -reachable- and rewritten as the non-provisional import check ground-game asked for by name. gr-e03's setup was restructured, not just renumbered: with values 2,2,2 its personal-edge test would have tied three ways and asserted nothing. BLOCKING: AM-7 fails at median 0.845 against its 0.9 floor. Isolated across three runs -- 3 problems + stand-in 0.97, 3 problems + edition 0.909, 4 problems + edition 0.845. State is BOUNDED (proven: identical after 5k and 100k events), so this is not the unbounded-growth defect AM-7 exists to catch; it is a bigger working set streaming a long log. Whether AM-7's floor is still right for a larger aggregate is a spec question and lowering it requires an ADR, so it is not being tuned here. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>
43 lines
1.1 KiB
YAML
43 lines
1.1 KiB
YAML
scenario: ground/gr-a02-solve
|
|
description: >
|
|
SOLVE discards a Solution of the Problem's suit and claims it
|
|
(GR-A02). A second solver of the same Problem the same round spends
|
|
nothing, because an earlier resolver in Lead order already claimed it.
|
|
covers: [GR-A02, GR-R07, GR-O04, GR-P04]
|
|
provisional: false
|
|
seed: 42
|
|
setup:
|
|
players: 3
|
|
preset: standard-3p
|
|
patch:
|
|
"lead": 0
|
|
"players.0.hand": [{ suit: Repair }]
|
|
"players.1.hand": [{ suit: Repair }]
|
|
commands:
|
|
- actor: P1
|
|
cmd: select_action
|
|
args: { action: SOLVE, problem: 1 }
|
|
- actor: P2
|
|
cmd: select_action
|
|
args: { action: SOLVE, problem: 1 }
|
|
- actor: P3
|
|
cmd: select_action
|
|
args: { action: INVESTIGATE, problem: 3 }
|
|
- actor: SYSTEM
|
|
cmd: reveal
|
|
- actor: SYSTEM
|
|
cmd: resolve
|
|
expect:
|
|
events:
|
|
- kind: SolutionDiscarded
|
|
player: 0
|
|
- kind: ProblemClaimed
|
|
problem: 1
|
|
by: 0
|
|
state:
|
|
# Problem 1 is the Clarify Surface Problem (GR-S01).
|
|
"problems.1.claimed_by": 0
|
|
"players.0.hand": []
|
|
# GR-A02: P2 resolved second, so its Solution is not spent.
|
|
"players.1.hand": [{ suit: Repair }]
|
|
rejects: []
|