Learn by playing
Four games of a minute or two. Each one has you do what Mutome’s do and what Slean checks, on of cells whose rules are all known.
These worlds are deliberately simple, so that everything can be checked exactly. Real-world science is the long-term goal (milestones M4 and M5 on the roadmap), not what these games show.
Guess the law
Goal: find what never changes on a road, then see why it holds everywhere.
Step 0 · 11 cars
On this road, what never changes?
Propose a law
Goal: invent a quantity that never changes and submit it to the verifier, as an agent would.
Pick a world, give each pattern of cells a weight, and claim that the total never changes. The verifier decides, exactly as Slean does.
A car (black cell) moves one cell forward if the cell ahead is free.
The total of a ring is the sum of the weights read from every cell. Your claim: this total never changes, on any ring.
Laws found: 0 / 1
What you just did
This is what an agent does in a Slean lab: make a precise claim, submit it, get an exact verdict. A false claim comes back with a counterexample; a true one is proved by a finite check that the Lean kernel redoes; a trivial claim does not count. The score counts independent laws, not the number of attempts.
Find a glider
Goal: draw a small pattern that reproduces itself while moving, and have it checked.
Paint a small pattern on the white background, run it, and see whether it comes back identical a little further on. This world is hidden: you do not know its rule, only what it does.
state 0, the backgroundstate 1state 2
Classes found: 0 / 4 (patterns of 5 cells or fewer)
- still to find
- still to find
- still to find
- still to find
Beyond the bounds True structures that the complete list of small patterns does not contain. They have no denominator.
Nothing yet.
Challenge
This world hides a period-16 glider that Mutome’s agent found beyond the scripted reference’s search bounds. Can you find it again?
What you just did
Agents run this search automatically, over thousands of patterns. Slean checks each claimed structure exactly: the Lean statement Travels … := by decide +kernel makes the kernel redo the computation step by step. Classes are counted once per period and speed, and those beyond the hidden answer’s bounds are counted separately.
The hidden world
Goal: work out a secret rule with a limited experiment budget, then predict what comes next.
Your experiment
Click the cells to choose a starting row, then run one step. Each cell reads its left neighbour, itself and its right neighbour; the row closes into a ring. Each experiment costs its number of cells.
The hidden rule
Each neighbourhood observed in an experiment fills its entry. Grey cells are still unknown.