14625377243every discstill to comeno covers:every valueis knowna ceiling, never a policy
On this page

A planner that is handed the entire future of a game: every disc that will arrive and every hidden gray number — before it plays, so we can measure how long a game could last if uncertainty were removed.

reads hidden values or the future: a teacher, never a policy

Its own source file says it in capitals: upper-bound diagnostic only. It is not a policy, it cannot be entered in any comparison with a real policy, and it is not even a proof of the best possible cheating play, because it prunes.

Why anyone would build this

Before spending months teaching a program to play well, it is worth knowing whether the target is reachable at all. The qualification standard is a mean above one million points, and the strongest legal search averages roughly a third of that. Two very different worlds are consistent with that gap:

  • the simulator simply does not permit long games, and a million-point average is arithmetically out of reach; or
  • long games exist and are common enough, and the difficulty is entirely one of choosing well under uncertainty.

Removing uncertainty separates the two. If a planner that knows everything still cannot survive, the objective is impossible. If it survives easily, then every point of the gap is attributable to not knowing, which is the problem the rest of the repository works on.

How it works, step by step

  1. Start a game from a seed. The harness knows the game's future disc stream and the reveal stream that turns gray discs into numbers.
  2. At each move, plan by beam search over that known future: expand every legal column, apply the actual next disc and the actual reveals rather than averaging over what might happen, keep the best few thousand resulting positions, and repeat for a fixed number of plies. The file's defaults are depth 12 and beam width 512, with a 500-move cap; the runs used in later experiments configure it down to depth 4 and beam 128.
  3. Rank the surviving plans by the score they accumulate, and play the first column of the best one.
  4. Advance one real move and re-plan. Dying is charged an enormous penalty, so the planner is effectively told to survive first and score second.

Because chance has been replaced by fact, there are no chance nodes here at all: the whole thing is a plain search over a known sequence. That is exactly what makes it illegal: a real player choosing between seven columns does not know which of them the next four discs will reward.

What happened

It survives, comfortably. In a twelve-game cohort it reached the 500-move cap in every single game and averaged over a million points, while public depth-3 search on the same games averaged about 133,000 and lived about 90 moves. In a separate sixteen-game matched audit at a much smaller beam it still hit the 200-move cap in all sixteen and won every paired game.

So the answer to the question the oracle was built to ask is: long games exist. What it did not, and cannot, show is that any of that is available to a player who must guess. The family page collects the several attempts to transfer it, all of which failed.

Three limitations belong in the same breath as the numbers. The cohorts were censored at a move cap, so those means are lower bounds on the oracle's own play and not comparable with uncensored games. They were scored with the historical 7,000-point level bonus, which the ledger preserves as Sequence- scored evidence and not as evidence for the Hardcore target. And the beam prunes, so this is a reachable ceiling, not the true perfect-information optimum.

Technical record
CohortConfigurationResultEvidence
Seed 0x3d700000, one gamereceding beam over the realized tape2,079,579 points, stopped by the 500-move capledger-recorded
0x3d950000...0b, 12 training-only gamesdepth 4 / beam 128, 500-move capcapped in all 12; mean 1,058,931.5 under the historical 7,000-point level bonus; paired public depth 3 averaged 132,979 points / 90.5 movesledger-recorded
0x3d70f000...0f, 16 gamesdepth 4 / beam 128, 200-move cap, matched against public depth 3oracle 429,182.5 points, capped in all 16, won every pair; depth 3 90,273 / 63.625 moves; clears and reveals per move 2.354 / 1.386 against 1.792 / 0.960ledger-recorded, historical 7,000-point seeds

The status summary records roughly 2.4 numbered clears and 1.4 reveals per move as the region associated with stable long games, treating those as diagnostic targets from limited runs rather than proven thresholds. The oracle's 2.354 / 1.386 sits essentially in that region while public depth 3, at 1.792 / 0.960, does not.

Records: experiment index "Oracle and curriculum research" (completed, ledger-recorded diagnostic); ledger, sections "Privileged-future oracle distillation" and "Privileged topology audit". Source: perfect-information-oracle/main.ts.

What this taught us, and what is still open

  • The million-point objective is not blocked by the rules of the simulator. Whatever else is hard, that is settled.
  • The gap between the oracle and legal search is a measure of the value of information, not a measure of how much better a legal policy could be. Later work (audit-05 §5.4) measured how much of the oracle's edge survives when the real tape is taken away, and the answer was: not much, and what remains is visible as board quality rather than as move preference.
  • The oracle remains useful as a generator: the positions it reaches are the input to the state curriculum and the topology audit. Whether those positions are worth practising from is still unmeasured.
RecordsTheories, experiments and results that reference this directory

Claim: Public board states visited by the perfect-information oracle after move 50 have a higher expected remaining lifetime under FAIR, public-randomness continuation than fair-D4-visited states matched on rise phase, occupancy and maximum height. Defining R_fair(O) and R_fair(F) as the mean remaining moves over K independent public futures under a fixed public continuation policy, and R_tape(O), R_real(F) as the realised remaining moves on the states' own trajectories, the transferable fraction tau = (R_fair(O) - R_fair(F)) / (R_tape(O) - R_real(F)) is at least 0.25, with the same sign in both split halves of the O pool, and the oracle's column at oracle-visited roots is fair-top-1 under common public futures at least as often as fair D4's column is.

This theory is currently not-supported-as-tested at the pilot (a small run to find bugs and project cost, not a strength claim) level.

It compares oracle-curriculum state pool relabelled under public randomness against fair-d4 matched state pool at the CHECK (mechanics checks only, no games played) level, using no-gameplay data.

valid run outcome: fail The run was valid and the outcome was fail (pilot (a small run to find bugs and project cost, not a strength claim)). Read the result.

resultvalid runoutcome: failtier: pilotRS-20260823T205143Z-ead14c9d

The run was valid; the outcome was fail, at the pilot (a small run to find bugs and project cost, not a strength claim) level. Of 4 preregistered checks, 2 passed and 2 failed.

Stage D0 refuses the H-pool theory on two of its three preregistered criteria. Pool O was 1,984 public states sampled from 64 oracle games (depth 4, beam 128; 63 of 64 games reached the 500-move cap); 1,271 were matched 1:1 to fair-D4 states on exact (rise phase, occupancy/4, max-height/2) buckets over all 256 comparator seeds (match rate 0.641; 713 O states dropped and counted). Under 32 common public futures with fair D1 continuation at horizon 25, oracle-visited boards are only marginally better than matched fair boards: R_fair(O) = 24.783 vs R_fair(F) = 24.520 (difference +0.263 moves, cluster bootstrap 95% [+0.156, +0.367], same positive sign in both origin-game halves). The preregistered transferable fraction is negative, tau = -0.959 (95% cluster interval [-3.069, -0.390]), because its denominator degenerates at this horizon: R_tape(O) = 24.338 vs R_real(F) = 24.611 (94-95% of both realised remainders were capped at 25), so the realised-lifetime gap the fraction was defined against is -0.274 moves rather than positive. Independently of that degeneracy, the action-quality criterion fails outright: the oracle's own column is fair-top-1 at its own roots less often than fair D4's column at the same roots (0.766 vs 0.814 over 1,271 roots, difference -0.049, 95% [-0.069, -0.029]; on the 194 unique-maximum roots 0.268 vs 0.387). Blocked-flow-band fraction over matched O states is 0.0047 (F: 0.026). Per the preregistration the theory is assessed not-supported-as-tested, the pool-comparison follow-on is not registered, and audit-05's H-pool program closes.

Technical recordLimitations recorded with the resultRS-20260823T205143Z-ead14c9d
  • The preregistered tau is ill-conditioned as measured: with 63 of 64 oracle games censored at the 500-move cap and comparator states drawn from the same shape buckets, both realised remainders sit at the 25-move horizon cap (R_tape(O) 24.34, R_real(F) 24.61, 94-95% capped), so the denominator is -0.274 moves instead of the large positive gap the definition assumed. The tau < 0.25 refusal is therefore driven by a degenerate denominator, not by a negative numerator; the numerator (the fair-value advantage of oracle boards) is positive but small, +0.263 moves on a 25-move horizon.
  • The fair-top-1 criterion is unaffected by that degeneracy and fails on its own: the oracle's action is fair-best at its own roots significantly less often than fair D4's action at the same roots.
  • Match rate 0.641: the 713 dropped O states skew toward buckets fair D4 rarely visits (matched O states are shape-matched by construction), so the numerator is a lower bound on the raw O-vs-F fair-value difference over all oracle states, and the comparison is conditional on shape overlap as preregistered.
  • R_fair uses a fixed public D1 continuation and horizon 25 with 32 futures; 92-96% of futures survive the horizon, so both pools are near the measurement ceiling and the +0.263 difference is compressed by censoring at both ends.
  • F origin games contribute clustered states (mean 12.6 matched states over 101 of 256 games); uncertainty uses cluster bootstrap over O origin games carrying matched partners, with the independent-clusters sensitivity interval also recorded (it is much wider: [-9.35, +5.12]).
  • Diagnostic tier (CHECK): no gameplay evidence and no policy claim; training-role seeds only, opened once.

Full record →

Agent contextSource files, operational notes and how to reproduce

Directory: approaches/oracle-curriculum/perfect-information-oracle

perfect-information-oracle