Step 4b of the Python-first core.
- core/solver.js is now a 250-line advisor (was 900 lines): it reads the game (core/spec/game.yaml,
published inside policy.json as model.game) and the count tables, and re-solves from any point in
a run with the same interpreter as the Python model. Same API for the site and Ken's bot
(advisor, recommendOption, solverHistory). The bot's on-screen text for each option moves to
game.yaml (bot_text); the deadly rolls carry their risk labels there too.
- tests/core/advisor.test.js: the advisor gives exactly the Python model's values and choices for
every colour and goal (to 1e-12, every decision on every published route), walks a run in the
game's order, and maps advice onto the bot's screen.
- Removed core/engine.js and everything that only compared it with Python (tests/parity/run_engine,
compare_runs, compare_results, compare_routes, compare_solver, compare_stats, analysis/stats/
analyze.py). In their place: tests/core/test_stats.py checks the statistics against known answers,
test_solver.py checks the route model on a synthetic world (tests/fixtures/synthetic_policy.py).
- analysis/network/build-graph.js reads the Python-coded runs; graph.json is byte-identical.
- docs/BOT_INTEGRATION.md: what changed for the bot (history keys, new choices, re-sync all three files).
Claude-Session: https://claude.ai/code/session_01UCzTd31GphpMXDhQqWrCMQ
Co-authored-by: Claude Opus 5.5 <noreply@anthropic.com>
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>