Step 2 of the Python-first, declarative core.
- core/spec/game.yaml: the game as data: every decision and its options, every roll and the
earlier steps its odds may depend on, every bonding encounter, and the flow of a run from the
entrance to the dragons (set / keep / drop / go / end / encounter). Also how the form's coded
answers map onto the game.
- core/atlas/model.py: what each coded run reveals about each step, count tables, empirical-Bayes
shrinkage, and the posterior draws (same random numbers as before, reproducible from the seed).
- core/atlas/solver.py: one interpreter of game.yaml used three ways (solve, evaluate a fixed
policy, export the published tree) instead of the tree written out five times. Vectorised
over the 200 posterior draws: the build takes about 2 minutes instead of 4, with no memory flag.
- planner/build_policy.py and policy_report.py replace the JS build and report.
Checked against the JavaScript model: every number in policy.json agrees to within 4e-12
(last-digit differences in log/cos). Three "still best" shares differ by one draw in 200, at
near-ties under the "eventually" objective. POLICY.md is otherwise identical.
tests/parity/compare_solver.py keeps checking JS against Python in CI until the site's JS advisor
replaces solver.js; tests/core/test_game.py checks game.yaml is complete and consistent.
Claude-Session: https://claude.ai/code/session_01UCzTd31GphpMXDhQqWrCMQ
Co-authored-by: Claude Opus 5.5 <noreply@anthropic.com>