- apps/atlas: the web page (valley map, route flow, Dragon Register) - packages/core: coding rules and statistics (engine.js) and the shared route graph (graph.js): scene graph, decision-variable graph, bot-to-form crosswalk, Beta credible intervals - packages/ingest: DragonKind bot importer to anonymised trajectories (no prose, no account identifiers); data/bot holds Ken's sample - research/python: independent reference implementation + update_sources.py - tests: JS/Python parity checks and graph/importer unit tests - CI, GitHub Pages deploy, daily check of the community sheets and route PDF - Email addresses in free-text form answers are redacted; the raw spreadsheet is not committed - MIT code licence, CC BY 4.0 data licence Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01UCzTd31GphpMXDhQqWrCMQ
1.8 KiB
1.8 KiB
Roadmap
The aim is to move from summary statistics to path finding: for each dragon colour, the decision policy that maximises the chance of bonding it, with honest uncertainty.
- Repo and packaging (done): monorepo, CI, GitHub Pages, JS/Python parity tests.
- Graph format (
packages/core, first version done): typed scene, chance and terminal nodes; history-context keys; per-source counts (bot, form, PDF, Discord); fingerprints and short labels only, no game prose. Importers inpackages/ingestfor the bot'sknowledge.json,runs.jsonlandencounters.jsonl(done), the form (done, via the crosswalk ingraph.js), and a PDF scene crosswalk (to do). Daily source checks for the form, the register and the PDF (done). - Context learning (
research/): tests of history dependence (G-tests, BH); variable-order Markov / context tree with BIC; temporal-tiered DAG structure learning (BDeu/BIC); latent "character" model vs specific triggers vs memoryless baseline, compared on held-out likelihood; hierarchical Dirichlet back-off pooling. - Solver: backward induction on the augmented state (scene, history summary), i.e. an influence
diagram with perfect recall. Two objectives side by side per colour:
- P(target colour on this attempt);
- eventual success when deliberate deaths are free: maximise p_X / (p_X + p_other bond), solved by Dinkelbach iteration. Monte Carlo credible intervals, top-k routes, required steps and bottlenecks.
- Valley graph UI: every option at every point, with P(survive) and P(bond) per colour, the policy overlay for a chosen colour, and untested branches marked.
- Bot loop: the atlas publishes
policy.jsonandexperiments.json(ranked by value of information); the private DragonKind bot consumes them and returns anonymised runs.