Busy beaver ones function $\Sigma(3)$

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

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

Value: $6$

Updates from the literature