Moves only; no behaviour changes. Every file now lives under the part of the project it belongs to, each section has a README, and docs/PRIVACY.md collects the rules all parts follow. core/ engine.js, graph.js, solver.js, python/clean.py collection/ sources/ (form, register, PDF check, daily update), bot/ (importer) analysis/ stats/ (Python statistics), network/ (build-graph.js), reports/ (POLICY.md) planner/ build-policy.js, policy-report.js site/ atlas/ (the page), build.js, qa/ tests/ core/ (unit), parity/ (JS vs Python), fixtures/ Checked against the previous layout: tests pass; coded runs, test outputs, graph.json and policy.json are byte-identical; the built site differs only in comments that name file paths. The published file names Ken's bot downloads (solver.js, graph.js, data/policy.json) are unchanged. Also removes the undefined/ folder of QA screenshots committed by mistake (the QA scripts now default to a temp folder) and test.txt, and drops the unused npm workspaces. Claude-Session: https://claude.ai/code/session_01UCzTd31GphpMXDhQqWrCMQ Co-authored-by: Claude Opus 5.5 <noreply@anthropic.com>
26 lines
2.0 KiB
Markdown
26 lines
2.0 KiB
Markdown
# 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.
|
|
|
|
1. **Repo and packaging** (done): monorepo, CI, GitHub Pages, JS/Python parity tests.
|
|
2. **Graph format** (`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 in `collection/bot` for the bot's `knowledge.json`, `runs.jsonl` and `encounters.jsonl`
|
|
(done), the form (done, via the crosswalk in `graph.js`), and a PDF scene crosswalk (to do).
|
|
Daily source checks for the form, the register and the PDF (done).
|
|
3. **Context learning** (`analysis/`): 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.
|
|
4. **Solver** (first version done: `core/solver.js`, `analysis/reports/POLICY.md`; still to do: richer history models from step 3): 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.
|
|
5. **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.
|
|
6. **Bot loop** (advisor and sync published, see `docs/BOT_INTEGRATION.md`; experiments.json to do): the atlas publishes `policy.json` and `experiments.json` (ranked by value of
|
|
information); the private DragonKind bot consumes them and returns anonymised runs.
|