Busy beaver shift function $BB(3)$

Rules and space-time diagram of the 3-state busy beaver that runs longest

The maximum number of steps made by a $3$-state, 2-symbol Turing machine that halts when started on a blank tape.

Value: $21$

Updates from the literature