← The interactive laboratory

Archived research / September 30, 2026 · Curated October 26

The Lying Map

Four rooms, six signs, ten fixed policies. An exact finite game about when checking the map helps and when it costs the very move needed to succeed.

Play the interactive arcade ↗

The arena

Three nonterminal rooms (Camp, Mill, Pond) each have two doors into one of four rooms (including Vault). The space contains 4⁶ = 4,096 fully specified physical worlds. The map starts accurate or contains one substituted door destination. A move, inspection, or one-use rope costs an action. Every episode starts at Camp and succeeds only by physically entering Vault before the action budget expires.

The policies

PairHow it acts
01 / 02 · BelieverFollow initial map; doesn't incorporate contradictions into planning.
03 / 04 · RepairerUpdate map when a move contradicts a sign; plan again.
05 / 06 · ExplorerIgnore initial signs, discover physical routes.
07 / 08 · ScoutInspect a door before traversing; use discovered destination in planning.
09 / 10 · DetectiveScout-like, but stops extra inspection after one falsified sign under an explicit one-error assumption.

Even-numbered slots have a rescue rope. Its activation criterion is deliberately conservative: the agent must have demonstrated there is no reachable unknown door or Vault path within the currently reached component. The rope returns it to Camp and preserves observations, but costs an action.

Why budget matters

Original finite result: with an eight-action cap, Repairer + rope wins 54,390 of 54,432 initially solvable one-error cases, versus 53,858 for Scout + rope. At ten actions, Scout + rope wins all 54,432 while Repairer + rope wins 54,420. The reversal was found in a post-hoc budget supplement—not a pre-registered experiment.

The result doesn't say Scout is universally best, nor that safety inspection is always beneficial. It says these hand-authored policies exhibit competing benefits of information, recovery, and action cost under a specific bounded task. The experiment also retained 1,072 impossible physical worlds as negative controls; impossible worlds never count as failures to solve a reachable maze in the quoted denominators.

Executed evidence and limitations

The original run reported 77,824 exhaustive primary pairs per policy × 10 = 778,240 scripted episodes, plus a separately selected 40,960-episode two-error stress panel. A budget sensitivity supplement used 217,728 additional scripted episodes after observing primary failures. The report includes case IDs and policy-specific counterexamples.

Original methods include 13 prelaunch tests, 65 post-run assertions, and 2,450 cross-language JavaScript-vs-Python sampled replay comparisons. Ten local processes shared one author-written implementation; none is a fresh or isolated AI-model agent. The browser page replays embedded examples and can generate additional toy maps, but does not re-run the full primary corpus when opened.

The complete source and raw 819,200 primary/stress episode evidence are not included in this curated exhibit. The full research audit therefore still depends on the original private test package. The archived standalone original and original report are SHA-verified copies from that historical package, not freshly independently qualified research.

Gallery navigation update · 2026-10-27: The public instrument adds only a scoped navigation bar and its styles. Scientific scripts, embedded data, and original instrument content are unchanged. The historical hashes identify the archived standalone original, not the navigation-adapted index.html.

Revisit the complete original caveats and witness descriptions in the public original report. The headline examples were selected after inspecting the results, and should not be mistaken for blinded discoveries or estimates of performance outside this small maze family.

Privacy review: fictional map material only; no personal/credential/private-architecture content, no runtime external network dependency.