BB(6) Champion Rule Map

Busy Beaver · 6 states, 2 symbols · found by mxdys, June 2025

What each rule in the BB(6) champion does

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.

1RB1RA_1RC1RZ_1LD0RF_1RA0LE_0LD1RC_1RA0RE Watch it run in the BB(6) Champion Explorer

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.

The rule table, sorted by job

StateReads 0Reads 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.

Crawl leftD1 E1 C0
D erases the cell and moves left, E steps back right, and C writes the 1 back and moves left again. The head ends one cell further left every three steps and the tape is unchanged. The crawl ends when E reads a 0.
Run rightA1
A keeps the 1 and moves right, one cell per step. The run ends when A reads a 0.
Recode rightC1 F1 E1
C writes 0, F writes 0 and E keeps the 1, so every 111 becomes 100, one cell per step. The recode ends when C, E or F reads a 0. When F reads it, F0 hands the head to the run.
FillE0 D0 A0 B0
A crawl that reaches the 00 of a 100 fills both 0s, and B writes back the cell D erased. The 100 becomes 111.
AppendA0 B0 C0
A run that reaches blank tape writes 111, and C turns the head into a crawl.
HaltB1
B normally lands on a cell that is 0, often one that D has just erased. Reading a 1 there stops the machine.

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.

The 0s are the signposts

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.

111011header100100100countdown 710010left marker11phase 2100100100100111111middle counter 60011100right marker111111111111pile 3 + spare

The pile holds one more 111 group than its value. A convert or reset turns that spare group into the next right marker.

The routines up close

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.

Crawl left

D11111110step 845 D reads 1: write 0, move left, go to E
E11110110step 846 E reads 1: write 1, move right, go to C
C11110110step 847 C reads 0: write 1, move left, go to D
D11111110step 848 D reads 1: write 0, move left, go to E

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.

Run right

F100marker111pile000blankstep 835 F reads 0: write 1, move right, go to A
A101111000step 836 A reads 1: write 1, move right, go to A
A101111000step 837 A reads 1: write 1, move right, go to A
A101111000step 838 A reads 1: write 1, move right, go to A
A101111000step 839 A reads 0: write 1, move right, go to B

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.

Append

A111pile11100000blankstep 1,064 A reads 0: write 1, move right, go to B
B11111110000step 1,065 B reads 0: write 1, move right, go to C
C11111111000step 1,066 C reads 0: write 1, move left, go to D
D11111111100step 1,067 D reads 1: write 0, move left, go to E

At the end of the pile A, B and C each write a 1. C moves left, so D starts the crawl back.

Fill Recode right Subtracting one, step by step

Crawl, last stepD erases the first cell of d1 and moves left onto d2, the lowest 1-digit.
D100100100111111111100step 1,030 D reads 1: write 0, move left, go to E
FillE reads the last 0 of d2 and moves left. D writes 1 into the middle cell, A writes 1 into the last cell, and B writes back the cell D erased. d2 is now 111, a 0.
E100100100011111111100step 1,031 E reads 0: write 0, move left, go to D
D100100100011111111100step 1,032 D reads 0: write 1, move right, go to A
A100100110011111111100step 1,033 A reads 0: write 1, move right, go to B
B100100111011111111100step 1,034 B reads 0: write 1, move right, go to C
RecodeC and F write 0 into the second and third cells of each digit, and E keeps the 1 that starts the next. d1 and d0 become 100, so both are now 1s. The sweep carries on over the gap and the marker's first three cells. The step over the marker and the crawl back put those right again.
C100100111111111111100step 1,035 C reads 1: write 0, move right, go to F
F100100111101111111100step 1,036 F reads 1: write 0, move right, go to E
E100100111100111111100step 1,037 E reads 1: write 1, move right, go to C
C100100111100111111100step 1,038 C reads 1: write 0, move right, go to F
F100100111100101111100step 1,039 F reads 1: write 0, move right, go to E
E100100111100100111100step 1,040 E reads 1: write 1, move right, go to C
C100100111100100111100step 1,041 C reads 1: write 0, move right, go to F
F100100111100100101100step 1,042 F reads 1: write 0, move right, go to E
E100100111100100100100step 1,043 E reads 1: write 1, move right, go to C
EndC reads the right marker's first 0, and the tick goes on with the step over the marker: C0 D1 E0 D0 A0 B0 C1 F0.
C100100111100100100100step 1,044 C reads 0: write 1, move left, go to D

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.

Each part of the calculation

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.

Crawl left Run right Recode right Fill Append Other fixed sequence

Tick

Middle counter above 0
beforeheader111011countdown3-cell digitsmarker+ phasemiddle counter3-cell digitsmarker0 11100pile111 groupsstartnext tick1234567afterheadercountdownsamemarkersamemiddle counterone lessmarkersamepileone group more

Counter − 1, pile + 1.

About 12 steps for every group in the pile, almost all of them in stages 5 and 7.

  1. crawlCrawl left over the counter's low 0-digits to its lowest 1-digit. D1 E1 C0 repeating
  2. fillFill: that digit's 100 becomes 111, a 0. E0 D0 A0 B0
  3. recodeRecode right: every lower 111 becomes 100, a 1. This is the borrow. C1 F1 E1 repeating
  4. fixedC reaches the right marker's first 0 and steps over the marker. F0 hands off to the run. C0 D1 E0 D0 A0 B0 C1 F0
  5. runRun right to the end of the pile. A1 repeating
  6. appendAppend one 111 group on the blank tape and turn around. A0 B0 C0
  7. crawlCrawl left over the whole pile and the marker back to the counter. Crossing the marker's 00 rebuilds it. D1 E1 C0 repeating; D1 E0 at the marker's 00

Convert

Middle counter 0, countdown above 0
beforeheader111011countdown3-cell digitsmarker+ phasemiddle counter3-cell digitsmarker0 11100pile111 groupsstartnext tick12345678910afterheadercountdownone lessmarkerphase − 1middle counterold pile = 2ᵇ − 1 at the bottommarkernewpile

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.

  1. crawlCrawl left over the whole counter. Every digit is 111, so nothing stops it. D1 E1 C0 repeating
  2. fixedCross the phase cells and the left marker. The marker is filled in for now. D1 E0 D1 E0 D0 A0 B0 C0
  3. crawlCrawl left over the countdown's low 0-digits. D1 E1 C0 repeating
  4. fillFill the countdown's lowest 1-digit: countdown − 1. E0 D0 A0 B0
  5. recodeRecode right: the lower countdown digits become 1s, and the same sweep writes 100 10 back as the left marker. F0 hands off. C1 F1 E1 repeating, then F0
  6. runRun right over the phase cells, the counter and the right marker's 111. A1 repeating
  7. fixedA reaches the right marker's first 0. A0 B0 fill the 00, so the marker joins the counter. A0 B0
  8. recodeRecode right over the pile: each 111 group becomes a 1-digit. C1 F1 E1 repeating
  9. fixedTurn the spare group into a new right marker and write the first group of a new pile. C0 D1 E0 D0 A0 B0 C1 F0 A0 B0 C0
  10. crawlCrawl left to the counter's new right end. D1 E1 C0 repeating

Reset

Middle counter 0, countdown 0, phase 1
beforeheader111011countdown3-cell digitsmarker+ phasemiddle counter3-cell digitsmarker0 11100pile111 groupsstartnext tick1234567891011afterheadershiftedcountdownrefilled: 1s, one 0-digit, 1smarker+ phase 2middle counter2ᵇ − 1markernewpile

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.

  1. crawlCrawl left over the counter. D1 E1 C0 repeating
  2. fixedCross the left marker, as in a convert. D1 E0 D1 E0 D0 A0 B0 C0
  3. crawlCrawl over the whole countdown, which has no 1-digit, then past the header's 0 to the blank tape. D1 E1 C0 repeating; D1 E0 at the header's 0
  4. fixedRebuild 111011 two cells further left. D1 E0 D0 A0 B0 C1 F1 E0 D0 A0 B0
  5. recodeRecode right over the countdown: every digit becomes a 1. C1 F1 E1 repeating
  6. fillThe sweep meets the 0 the crawl left after the old marker. C0 turns back and a fill sets the digit just written back to 0. This is the countdown's single 0-digit. C0 D1 E0 D0 A0 B0
  7. recodeRecode right over the old phase cells and the whole counter. All of it becomes 1-digits of the countdown. C1 F1 E1 repeating
  8. fillE reaches the right marker's first 0 and fills the 00. The new left marker and two phase cells form here, where the old right marker was. E0 D0 A0 B0
  9. recodeRecode right over the pile: it becomes the new counter. C1 F1 E1 repeating
  10. fixedBuild a new right marker and the first group of a new pile, as in a convert. C0 D1 E0 D0 A0 B0 C1 F0 A0 B0 C0
  11. crawlCrawl left to the counter's right end. D1 E1 C0 repeating

Halt

Middle counter 0, countdown 0, phase 0
beforeheader111011countdown3-cell digitsmarker+ phasemiddle counter3-cell digitsmarker0 11100pile111 groupsstarthalt12345678

The machine stops. Stages 1 to 7 are the same as a reset.

  1. crawlCrawl left over the counter. D1 E1 C0 repeating
  2. fixedCross the left marker. D1 E0 D1 E0 D0 A0 B0 C0
  3. crawlCrawl over the countdown and the header to the blank tape. D1 E1 C0 repeating; D1 E0 at the header's 0
  4. fixedRebuild the header two cells further left. D1 E0 D0 A0 B0 C1 F1 E0 D0 A0 B0
  5. recodeRecode right over the countdown. C1 F1 E1 repeating
  6. fillBounce and fill at the old marker. C0 D1 E0 D0 A0 B0
  7. recodeRecode right over the old phase cells and the counter. C1 F1 E1 repeating
  8. haltF reaches the right marker's first 0. F0 writes 1, A0 writes 1, and B lands on the pile's first 1. B1 is the halt rule. F0 A0 B1

Why the phase decides between reset and halt

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.

11100111Right marker 11100, then the pile
Running rightconvertAAAAA0 B0 fill the 00, then C recodes the pile into 1-digits.
Recode, phase 1resetECFEE0 D0 A0 B0 fill the 00, then C recodes the pile into the new counter.
Recode from a borrowtickCFECC0 turns back, C0 D1 E0 D0 A0 B0 C1 F0 step over the marker, then the run heads for the end of the pile.
Recode, phase 0haltFECFF0 and A0 fill the 00, then B reads the pile's first 1. B1 halts.
Which state reads the right marker's first 0 decides what happens next. Each row lists the states that read the marker's cells, left to right, up to that first 0.

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.

How the tape gets set up

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.

017751402467028211The header2The right marker3The left marker4A first number (5)5Five ticks6The final resetstepblank tapephase 2tape after step 820header111011countdown7marker100 10middle counter63marker0 11100pile0
The real run's first 821 steps, to scale: one row per step and one column per cell. Shaded columns are cells holding a 1, so you can watch the header move left each time it is rebuilt and the pile grow to the right. The numbers match the stages listed below. Crawl left Run right Recode right Fill Append Other fixed sequence Cell holding 1
  1. steps 0–16

    The header

    appendcrawlfixed

    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.

    Every rule, in order
    steps 0–2AppendA0 B0 C0
    steps 3–6Crawl leftD1 E1 C0 D1
    steps 7–16Header sequenceE0 D0 A0 B0 C1 F1 E0 D0 A0 B0
    Tape after step 16111011header1one more 10blank
  2. steps 17–74

    The right marker

    crawlfixedrecode

    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.

    Tape after step 74111011header011100right marker111spare group
  3. steps 75–139

    The left marker

    crawlfixedrecodefill

    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.

    Tape after step 139111011header10010left marker11phase 2011100right marker111spare group
  4. steps 140–245

    A first number

    crawlfixedrecode

    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.

    Tape after step 245111011header100111100number 101 = 5011100right marker111111pile 1 + spare
  5. steps 246–701

    Five ticks

    crawlfillrecoderunappend

    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.

    Tape after step 701111011header111111111number 0011100right marker111111111111111111111pile 6 + spare
  6. steps 702–820

    The reset that starts the main run

    crawlfixedrecodefill

    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.

    Tape after step 820111011header100100100countdown 710010left marker11phase 2100100100100100100middle counter 63011100right marker111spare group

From step 821 the run follows mxdys's rules: 63 ticks empty the counter, and the first convert comes at step 28,297.

Where the steps go

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.