Screen tree, register rows in the master list, and bot runs coded from the picks that were played
CI / test (pull_request) Canceled after 0s
CI / test (pull_request) Canceled after 0s
- analysis/tree/build_tree.py -> data/public/tree.json, analysis/reports/TREE.md: every screen the bot has seen, every option, where each led (fixed or dice, with ranges), best known picks per colour chosen cautiously, where any picks end, and the untested options. solver.js screenPick(): least-tried and Thompson picks from the tree. - The bot logs a pick it then overrode as a step: 37 runs were coded with choices they never made. Importer and graph.js now use the played steps only. - runs_clean.csv: the Unofficial Dragon Register's 288 bonded dragons are in the master list as outcome-only rows, flagged (no analysis uses them). - Cycle, refresh and the bot kit rebuild and carry the tree; tests check every generated report is current. Co-Authored-By: Claude Fable 5.2 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_014jqCC2LZ4x1WHQ1V57nTsv
This commit is contained in:
co-authored by
Claude Fable 5.2
parent
d01ec46fcc
commit
f8e4f575f4
@@ -78,3 +78,22 @@ holding its gaze are unexplained, and the screens before it are where the explan
|
||||
the difference is something the site knows about the account, and these are the candidates we can see.
|
||||
|
||||
The plan updates itself from the runs: a finished experiment stops being assigned and its share goes to the others.
|
||||
|
||||
## The screen tree, and two things found in the logs (16 November)
|
||||
|
||||
`tree.json` is now in the kit: every screen the bot has stood on, every option on it, how often each was played and
|
||||
where it led (`analysis/reports/TREE.md` is the readable version). 47 of the 116 options seen have never been played.
|
||||
|
||||
- **Picking from the tree.** `Solver.screenPick(tree, sceneId, offeredTexts, { mode, seed })` returns the option to
|
||||
pick. `plan.screenPicks` says when: `least-tried` in the mapping experiment (fills the gaps first), `thompson`
|
||||
while bonding the target dragon (tries untested answers, drops the ones that kill). The four deadly screens of the
|
||||
Blue encounter have only ever been answered one way each, so their other answers are unknown.
|
||||
- **Overridden picks are in the logs as if they were played.** In 37 runs the bot logged the atlas's pick with
|
||||
`to: "BURNED"` and then, on the same screen, the pick its own rule made (91 steps: first direction 37, the fork 33,
|
||||
the dagger 11, the first dragon 9). The atlas now drops such steps, in the importer and in `graph.js`
|
||||
(`playedSteps`), so the runs are coded with the choices that were made. Two things for the bot: log an overridden
|
||||
recommendation as something other than a step, and note that in those runs the atlas's direction and fork advice
|
||||
never took effect (`ENTER_TOWARDS_FOREST_CENTER` and `ROAD_FORK_DEEPER_FOREST` won). The experiments need the
|
||||
plan's picks to win over those rules.
|
||||
- **The best-reported route has already been played 64 times on later attempts** (alone, west, engage the smaller
|
||||
cadet, squadmate's revenge, fork west) with no shadow, which matches riders' 1 in 80.
|
||||
|
||||
@@ -22,7 +22,7 @@ python -m collection cycle --bot /path/to/DragonKind --deliver /path/to/DragonKi
|
||||
2. **Refit.** When there are new runs it rebuilds the coded runs, the route model (`policy.json`) and
|
||||
3. **Re-plan:** the experiment plan (`experiments.json`): progress per arm, and which experiments are still
|
||||
running (`planner/experiments.yaml` is the design).
|
||||
4. **Deliver.** It copies `policy.json`, `experiments.json`, `solver.js` and `graph.js` into the `--deliver` folder,
|
||||
4. **Deliver.** It copies `policy.json`, `experiments.json`, `tree.json`, `solver.js` and `graph.js` into the `--deliver` folder,
|
||||
each file whole, then writes `atlas-kit.json` (`policyId`, `planId`, checksums) last. The bot should load the
|
||||
kit at the start of an attempt, never in the middle of one, and log both ids on the run.
|
||||
|
||||
@@ -57,6 +57,8 @@ const advisor = Solver.advisor(policy.samples.all, a.target, a.objective,
|
||||
attempts; then the account retires, except two in ten, which keep going (one repeating a path, one varying it).
|
||||
- `plan.record` lists what to log about the account on every run; `plan.scripts.shadow` is the sequence to follow
|
||||
once the shadow shows (`docs/BOT_CYCLE_FOR_KEN.md`).
|
||||
- `tree.json` is the screen tree (every screen, every option, where each led). `plan.screenPicks` says where the
|
||||
bot picks from it with `Solver.screenPick(tree, sceneId, offeredTexts, { mode, seed })`.
|
||||
- With squadmates, staying together and the direction are one screen; `recommendOption()` answers both at once
|
||||
and says so in `also`.
|
||||
|
||||
|
||||
@@ -309,3 +309,24 @@ Branch `first-attempt-cycle` (not merged, not pushed).
|
||||
- **Not known.** What differs between fresh accounts that see the shadow and those that do not on the same route;
|
||||
what "twenty" counts; why holding the Black's gaze fails three times in ten.
|
||||
- **To tidy.** One public `bond_note` holds a rider's handle ("Run 116 - ..."), in a row marked as a first attempt.
|
||||
|
||||
## 12. Update, 2026-11-16 (later): the master list, the screen tree, and a fix to the bot's rows
|
||||
|
||||
- **Master list.** `runs_clean.csv` now has 8,853 rows: spreadsheet 8,132 (every row of "Form Responses 1"; the
|
||||
workbook's other tabs are views of it), bot 421 (every trajectory), register 288 (new: bonded dragons, outcome
|
||||
only, each flagged because the same run may be in the spreadsheet), Reddit result pages 12. Not in it because
|
||||
nothing has been collected: Discord run reports (the only Discord export is the developer's channel, which holds
|
||||
no runs), "Report a run" (0 reports), megathread comments (needs the Reddit API keys; the 12 were read by hand on
|
||||
19 October). Stale: the spreadsheet was last fetched 12 November and the bot's data 10 November.
|
||||
- **Possible duplicates, left in.** 17 spreadsheet rows are identical to another including the timestamp; 204 more
|
||||
are identical except for the timestamp (the same route and death repeated, or a double submission).
|
||||
- **Fix.** The bot logs a pick it then overrode as a step. 37 bot runs were coded with choices they never made
|
||||
(direction, fork, dagger, reaction); they are now coded from the played steps (`collection/etl/runs.py` `played`,
|
||||
`core/graph.js` `playedSteps`).
|
||||
- **Screen tree.** `analysis/tree/build_tree.py` -> `data/public/tree.json` and `analysis/reports/TREE.md`, from
|
||||
the bot's logs: 45 screens, 116 options (69 played), which options are dice and their rates, the best known picks
|
||||
per colour (chosen cautiously), where any set of picks ends, and the untested options. Blue: a Blue waits on 11.4%
|
||||
of meadow visits and the bonding chain has survived 18.7%, so 2.1% per run on the answers tried so far.
|
||||
`screenPick()` in `core/solver.js` picks from the tree (least-tried, or Thompson). Rebuilt every cycle; in the kit.
|
||||
- **Limit.** The tree treats a screen's odds as the same whatever came before. That is right for the seeded draws
|
||||
and wrong for the shadow. It holds only what the bot has played: no first attempts, no shadow, one Green bond.
|
||||
|
||||
Reference in New Issue
Block a user