Route model: first attempts are their own shadow roll; experiment plan and automated bot cycle
- game.yaml: `givens` (first or later attempt) and `distinct` levels that are not pooled; the shadow roll
depends on the attempt first. Form submissions show the shadow on 9% of first attempts and 0.3% of later ones.
- Reporting bias: a roll whose bias cannot be measured can borrow another roll's (`borrow: {shadow: meadow}`),
so form submissions inform the shadow again. An assumption, stated in planner/policy.yaml.
- policy.json: targets.<colour>.firstAttempt (this attempt, eventually). Black: about 1.4% on a first attempt,
0.07% on a later one.
- solver.js: advisor options `attempt`, `fix`, sampling "uniform"; assign() and armFor() for the plan.
- planner/experiments.yaml + build_experiments.py -> data/public/experiments.json (progress and status per
experiment, rebuilt from the bot's runs).
- python -m collection cycle: import bot runs, refit, re-plan, deliver the kit; .gitea/workflows/bot-cycle.yml.
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
ee07ee143e
commit
ab3664f369
@@ -48,6 +48,63 @@ class Bias(unittest.TestCase):
|
||||
self.assertEqual(model.fit_alpha(T, "meadow")["alpha"], max(model.ALPHA_GRID))
|
||||
|
||||
|
||||
def test_unestimable_bias_can_borrow_another_rolls_estimate(self):
|
||||
# the shadow was never seen in complete logs, the meadow Blue was: the form's shadow reports count 1/rho(meadow)
|
||||
cfg = {**CFG, "rolls": {"shadow": "yes", "meadow": "Blue"}, "borrow": {"shadow": "meadow"}}
|
||||
runs = self.runs(10, 100, 100, 300) + [tree_run("bot", False)] * 100 + \
|
||||
[tree_run("reddit spreadsheet", True)] * 8 + [tree_run("reddit spreadsheet", False)] * 92
|
||||
prep = [model.prepare_run(r) for r in runs]
|
||||
est, names = bias.estimate(runs, prep, cfg, set())
|
||||
e = est["form"]["shadow"]
|
||||
self.assertAlmostEqual(e["rho"], est["form"]["meadow"]["rho"])
|
||||
self.assertIn("assumed", e["used"])
|
||||
self.assertFalse(e.get("exclude"))
|
||||
T = model.count_tables(prep, bias.weights(names, prep, est, cfg["rolls"]))
|
||||
self.assertAlmostEqual(T["shadow"]["1:First attempt"]["yes"], 8 / e["rho"], places=3)
|
||||
# without `borrow`, the group is left out of the roll
|
||||
est2, _ = bias.estimate(runs, prep, {**cfg, "borrow": {}}, set())
|
||||
self.assertTrue(est2["form"]["shadow"]["exclude"])
|
||||
|
||||
|
||||
def tree_run(source, shadow, attempt_group="First attempt"):
|
||||
r = meadow_run(source, "Orange")
|
||||
r.update(scream="Investigate & help", resolution="Squadmate's revenge", post_path="Forest", hour="Tree",
|
||||
branch="Shadow (rare)" if shadow else "Descend slowly: two Greens", outcome_color="Black" if shadow else "Green",
|
||||
enc_Orange=None, enc_Black="Incinerated" if shadow else None, enc_Green=None if shadow else "Incinerated",
|
||||
saw_blue_meadow=None, attempt_group=attempt_group, combat_first=None, combat_second=None)
|
||||
return r
|
||||
|
||||
|
||||
class FirstAttempt(unittest.TestCase):
|
||||
"""game.yaml `givens`: first and later attempts are different shadow rolls (`distinct`), not pooled."""
|
||||
|
||||
def setUp(self):
|
||||
runs = [tree_run("bot", True)] * 9 + [tree_run("bot", False)] * 91 + [tree_run("bot", False, "Later attempt")] * 900 + \
|
||||
[tree_run("bot", True, "Later attempt")] * 1
|
||||
self.T = model.count_tables([model.prepare_run(r) for r in runs])
|
||||
|
||||
def test_each_attempt_kind_keeps_its_own_rate(self):
|
||||
p = model.Params(self.T, "mean", alphas={"shadow": 100000})
|
||||
gated = {"scream": "Investigate the scream", "clearing": "Help your squadmate"}
|
||||
later = float(p.chance("shadow", gated)["yes"][0])
|
||||
first = float(p.having(attempt="First attempt").chance("shadow", gated)["yes"][0])
|
||||
self.assertAlmostEqual(first, 0.09, delta=0.01) # not dragged to the pooled 1%
|
||||
self.assertAlmostEqual(later, 0.001, delta=0.001)
|
||||
self.assertEqual(p.given, {"attempt": "Later attempt"}) # the default: a later attempt
|
||||
|
||||
def test_policy_reports_the_first_attempt_separately(self):
|
||||
from atlas import solver
|
||||
runs = [tree_run("bot", True)] * 9 + [tree_run("bot", False)] * 91 + [tree_run("bot", False, "Later attempt")] * 900
|
||||
pol = solver.build_policy([dict(r, enc_Black="Bonded!", outcome="Bonded") if r["branch"] == "Shadow (rare)" else r for r in runs],
|
||||
draws=6, colours=["Black"], min_support=1)
|
||||
t = pol["targets"]["Black"]
|
||||
f = t["firstAttempt"]
|
||||
self.assertEqual(f["given"], {"attempt": "First attempt"})
|
||||
self.assertGreater(f["thisAttempt"]["pX"]["point"], 20 * t["thisAttempt"]["pX"]["point"])
|
||||
self.assertLessEqual(f["thisAttempt"]["pX"]["lo"], f["thisAttempt"]["pX"]["hi"])
|
||||
self.assertIn("pEventually", f["eventually"])
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
unittest.main()
|
||||
|
||||
|
||||
Reference in New Issue
Block a user