Move 37
Search begins after the new board is revealed.
Verifier-driven research / active paper v1
InnovationZero is reported to learn from earlier scored algorithm games—changing the first executable artifact before a new task-time search begins.
Paper SHA-256
7a80bbfac4f20a9db7b94bd46111fa6262d72bc65dbcf33c3605a484f68dabce
Move 37 discovers inside a game. Move 42 asks what experience can change before the next game opens. Scroll forward, or use J and K to move chapter by chapter.
01 / The game
The board is not a metaphor for taste. It is a contract: data enters, code executes, an honest referee scores what survives.
Search begins after the new board is revealed.
Both systems must produce legal artifacts under the same verifier.
Earlier scored games alter what can be played before new search begins.
02 / State
A table defines constraints: shape, types, missingness, target geometry, and the evaluator that will reject invalid play.
Read the new position and form a task-specific plan.
Observe the same visible state and hidden evaluation boundary.
Begin with a learned policy over executable algorithm structure.
03 / Move
A proposal counts only when it parses, trains, predicts, and returns the required shape within the referee's limits.
Generate or edit code during task-time search.
Pay the real cost of execution and receive measured outcomes.
Emit a first artifact shaped by prior algorithm games.
04 / Policy
InnovationZero is reported as learning from histories of executable candidates and their scores, not from prose descriptions alone.
A general code model supplies the initial proposal distribution.
Can still use a task-time evaluator loop.
Algorithm-game outcomes train the policy that supplies the first artifact.
05 / Value
A useful value signal is bound to the artifact, dataset split, evaluator, and failure rules. Unverified elegance receives no credit.
Use fresh evaluations to estimate which branch is promising.
Rely on the referee rather than self-assessment.
Carry learned value from earlier games into the opening choice.
06 / Search
Online AutoResearch starts a new task-time search. InnovationZero uses earlier scored algorithm games to change the first executable artifact; bounded search remains a separate mode.
Start the loop now: propose, run, inspect, revise.
May improve when granted additional task-time evaluations.
Change the first legal program before the new loop starts.
07 / Score
Strict, bounded, and frontier numbers answer different questions. Combining them would turn a useful comparison into a false one.
Often reports the best artifact found within an online budget.
Must publish denominator, field, and selection policy.
Reports strict first move separately from bounded probe and diagnostic frontier.
08 / Experience
The training record is finite and inspectable: generations, promotions, processed rows, and summed generation-hours.
Task-time trajectories disappear when only the winning artifact is shown.
Need receipts to distinguish a measured run from a story about one.
Publishes campaign totals with their limits and source hashes.
09 / Self-play
Candidate programs play against a verifier. The retained frontier supplies experience for later openings without pretending every generated program is useful.
Search traces optimize one newly presented task.
Learn only from executions that the referee can reproduce.
Aggregate scored games into training data for the next policy.
10 / Transition
Move 37 symbolizes a discovery inside one game. Move 42 asks whether accumulated algorithm games can improve the move made before a new search begins.
A singular task-time discovery.
A result that matters only after the referee accepts it.
A learned first move across future algorithm games.
11 / First move
The strict mode freezes one global executable artifact before task-time selection. It is less flattering than the frontier and more informative about the opening policy.
Performance includes fresh search on the revealed task.
Can be evaluated in a field of executable contenders.
The frozen opening scores 1108.8 Elo and ranks 14 of 98 in the reported ledger.
12 / Evidence
The 600 released cases are outcome-ranked to show mechanisms and failures. The complete matched cohort is the denominator for population statements.
Showcase cases can illuminate how a search found a useful structure.
Must disclose selection when examples are chosen after outcomes are known.
Labels 600 atlas cases as non-representative beside the 1,649-case cohort.
13 / Limits
These are company-reported results on a historical evaluation record. They do not establish general intelligence, causal mechanism, or safety in untested domains.
Online search may spend more compute and adapt more deeply to one task.
Can fail on distribution shift, bad objectives, leakage, or weak referees.
Depends on the coverage and integrity of earlier algorithm games.
14 / Every game
‘Alien code’ is vision language: unfamiliar executable artifacts may become possible, but every artifact must parse, run, and earn its score under an honest referee.
Search for a move no human would have proposed.
Accept surprise only after executable verification.
Learn openings that make new forms of algorithmic play more likely.