Busy beaver ones function $\Sigma(1)$

Rules and space-time diagram of the 1-state busy beaver that writes the most ones

The maximum number of 1s left on the tape by a $1$-state, 2-symbol Turing machine that halts when started on a blank tape.

Value: $1$

Updates from the literature