Busy Beaver · 6 states, 2 symbols · found by mxdys, June 2025
The champion's table has twelve entries: six states, each with one rule for reading 0 and one for reading 1. Sorted by what they do, they form three ways to move along the tape plus a few short fixed sequences. Every part of the calculation uses the same routines in a different order, and the 0s on the tape decide which routine runs next.
Hover over or tap any rule name, such as D1, to see what it does. The Rules button in the corner opens the full table.
| State | Reads 0 | Reads 1 |
|---|---|---|
| A | write 1, →, Bfillappend | write 1, →, Arun |
| B | write 1, →, Cfillappend | write 1, →, halthalt |
| C | write 1, ←, Dcrawlappend | write 0, →, Frecode |
| D | write 1, →, Afill | write 0, ←, Ecrawl |
| E | write 0, ←, Dfill | write 1, →, Ccrawlrecode |
| F | write 1, →, Arecode hand-off | write 0, →, Erecode |
Each entry says what to write, which way to move and the next state. Because that last letter names the state that acts next, rules always chain: C0 is followed by a D rule, E1 by a C rule. Every sequence on this page is written in that order. Four rules belong to two routines.
E1 is where the crawl and the recode meet. E always moves right into C, and C's cell decides which routine carries on. In a crawl that cell is the one D just erased, so C reads 0 and turns left. In a recode it is a fresh 1, so C reads 1 and keeps going right.
The 3-state cycles set the digit size. One turn of C, F and E rewrites exactly three cells, which is why both counters use 3-cell digits: 100 for 1 and 111 for 0.
From step 821 on, the tape has this shape between events. This is the real run at step 1,013, with the head on the counter's last cell. Every routine passes over 1s, so the 0s, shown dark, are where things change.
The pile holds one more 111 group than its value. A convert or reset turns that spare group into the next right marker.
Real steps from the run. The outlined cell is under the head, the letter is the head's state, and the text says which rule fires next.
On the pile. D erases a cell and moves left, E steps back onto it, and C writes the 1 back and moves left. D is now one cell further left. Three steps per cell.
F0 ends the step over the right marker and hands off to A. A runs over the pile's 1s until it reads the blank tape.
At the end of the pile A, B and C each write a 1. C moves left, so D starts the crawl back.
Every step from 1,030 to 1,044. The counter holds 60, written 111100, and the frames show its last five digits, d4 to d0. They go from 1 1 1 0 0 to 1 1 0 1 1, so the counter now reads 111011, or 59.
The head's path through each event, drawn against the tape. Time runs down the page. A crawl takes three steps per cell, so crawl segments are drawn three times steeper than runs and recodes. Region widths are schematic, and the numbers match the list beside each drawing.
Counter − 1, pile + 1.
About 12 steps for every group in the pile, almost all of them in stages 5 and 7.
Countdown − 1 and the phase moves on. The pile's b units become b 1-digits at the bottom of the counter, so it holds 2ᵇ − 1, and the pile starts over.
Mostly one recode pass over the pile at one step per cell. In the real run it is less than half as long as the tick before it.
The countdown takes over the old marker, phase cells and counter, and refills to nearly all 1-digits. The pile becomes the next counter, 2ᵇ − 1. The phase is 2 again.
A crawl over everything left of the counter, then one recode pass to the end of the pile.
The machine stops. Stages 1 to 7 are the same as a reset.
The countdown and the left marker sit on one 3-cell grid. The middle counter, the right marker and the pile sit on another. The phase is the offset between the two grids, 0, 1 or 2 cells, and the decoder shows it as the 1s between the left marker and the counter.
Ticks never compare the two grids. A convert makes the stretch between the markers 3b + 5 cells longer. Five cells is one digit plus two, so the offset steps from 2 to 1 to 0 and back to 2.
In a reset or a halt, the long recode starts on the left grid and runs all the way to the right marker. Its three states repeat every three cells, so the offset decides which state reaches the marker's first 0. A tick's recode starts on the right grid, so it always arrives as C.
After the warm-up the countdown never runs out in phase 2. mxdys's analysis has it running out twice in phase 1, which gives two resets, and then in phase 0, which gives the halt. It does happen once during the warm-up, at step 140, while both counters are still empty. There the sweep arrives as C and the event ends like a tick.
The machine has no separate setup code. From a blank tape it runs the same routines as the rest of the run, and its first six events, working on empty or tiny numbers, build the layout one piece at a time. Each tape below is the real tape at the end of a stage, with the head's cell outlined.
A, B and C write 111 on the blank tape, as in an append, and C turns left. The crawl back runs off the left end onto blank tape, where E reads a 0. That starts the sequence that rebuilds the header in a reset, and it turns these cells into 111011.
| steps 0–2 | Append | A0 B0 C0 |
| steps 3–6 | Crawl left | D1 E1 C0 D1 |
| steps 7–16 | Header sequence | E0 D0 A0 B0 C1 F1 E0 D0 A0 B0 |
C turns back at the blank tape. The crawl again finds nothing to stop at and runs off the left end, and the header sequence rebuilds the header two cells further left. A short recode reaches blank tape, and the sequence that ends every convert and reset builds the first right marker with one pile group after it.
Order: crawl left, header sequence, recode right, end sequence, crawl left.
Nothing sits between the header and the right marker, so the crawl runs to the left end again. This is a reset. The recode reaches the right marker as E, and as in every reset the old right marker becomes the left marker plus two phase cells. Every part of the layout now exists, with the countdown and the counter both empty.
Order: crawl left, header sequence, recode right, fill at the right marker, recode the pile, end sequence, crawl left.
Countdown 0, counter 0 and phase 2, the only time the run has that combination. The reset-style sweep turns the left marker and phase cells into digits, and its bounce at the old marker leaves one 0-digit, giving 101, which is 5. In phase 2 the sweep reaches the right marker as C, so the event ends like a tick and adds a pile group.
Order: crawl left, cross the left marker, crawl left, header sequence, recode right, bounce and fill, recode right, step over the right marker, run right, append, crawl left.
The number counts down 5, 4, 3, 2, 1, 0 while the pile grows to 7 groups. There is no left marker yet, so the number works as a middle counter with no countdown beside it.
Order: five ticks, each in the order of the Tick route above.
No left marker is in the way, so all three digits become 1s with no 0-digit, which gives countdown 7. The right marker becomes the left marker plus phase 2. The 7-group pile becomes the counter: six 1-digits, worth 63 = 2⁶ − 1, and the seventh group becomes the new right marker.
Order: crawl left, header sequence, recode right, fill at the right marker, recode the pile, end sequence, crawl left.
From step 821 the run follows mxdys's rules: 63 ticks empty the counter, and the first convert comes at step 28,297.
Almost all the time goes into ticks, and a tick is mostly travel. In the first 20 million steps of the real run, 74.9% are crawl steps and 24.9% are run steps. Fills, appends, recodes and the other fixed sequences share the last 0.2%.
The 3-to-1 split comes from the costs: each tick crawls back over every pile cell at three steps per cell and runs out over the same cells at one step per cell. That is about 12 steps per pile group, and the pile grows by one group every tick.