The Valley as the landing page: dragons first, routes on demand
- New tab order: The Valley, The Odds, The Dragons, Deep Dive, Data & Methods (Route Flow and Blue & Black fold into Deep Dive; methods into Data & Methods; old #links redirect). - explorer.js replaces the trails map and the route planner, with progressive disclosure: the painted valley shows landmarks and the dragons where riders meet them (faint = rarely met), no routes and no deaths; hover for a note; choose a dragon to draw every route to every place it can be bonded, with width = chance of still being on the route, and solid / dashed / dotted and opacity for how a route compares with the best; click a choice point to branch off and re-plan; "Why this route?" holds intervals and risks; a toggle shows the community's actual traffic; #valley/blue/meadow-Blue links. - dragons.js: original dragon silhouettes in six poses, built from simple parts. - Solver: route to one specific encounter (only: [...]); ENCOUNTERS per colour, including the Greens rescue for Orange and Brown. - The Odds rewritten for all six dragons, ranked easiest to hardest. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01UCzTd31GphpMXDhQqWrCMQ
This commit is contained in:
co-authored by
Claude Opus 5.5
parent
bdf66afabc
commit
de80e99c74
@@ -88,6 +88,18 @@ test("advisor matches the solver's own decisions on the recommended route", () =
|
||||
assert.strictEqual(adv.next({}).choice, policy.targets.Blue.eventually.tree.choice);
|
||||
});
|
||||
|
||||
test("routing to one encounter: Blue only at the meadow equals the Blue policy; only at the tree Greens gives 0", () => {
|
||||
const meadow = S.advisor(policy, "Blue", "thisAttempt", { only: ["meadow-Blue"] });
|
||||
const all = S.advisor(policy, "Blue", "thisAttempt");
|
||||
assert.ok(Math.abs(meadow.value.x - all.value.x) < 1e-6);
|
||||
const greens = S.advisor(policy, "Blue", "thisAttempt", { only: ["tree-Greens"] });
|
||||
assert.ok(greens.value.x < 1e-9);
|
||||
// Brown via the Greens rescue is possible in this world
|
||||
const rescue = S.advisor(policy, "Brown", "thisAttempt", { only: ["tree-Greens"] });
|
||||
assert.ok(rescue.value.x > 0.05, rescue.value.x);
|
||||
assert.ok(meadow.attempts("meadow-Blue") > 100);
|
||||
});
|
||||
|
||||
test("solverHistory converts form variables", () => {
|
||||
const h = S.solverHistory({ company: "Alone", direction: "Center", first_sighting: "Red", resolution: "Tourniquet", hour: "Tree", branch: "Descend slowly: two Greens" });
|
||||
assert.deepStrictEqual(h, { company: "Alone", direction: "Center", fs: "Red", cadet: "Tourniquet", post: "(no fork)", hour: "Tree", descend: "Slowly (two Greens)", shadow: "no" });
|
||||
|
||||
Reference in New Issue
Block a user