Explanation
Simulates the 2 to 6 state busy beaver - a Turing machine that writes as much non-blank on its tape as possible. The 5 and 6 state ones are capped. Optimality has not been proven for the 6-state one yet.en.wikipedia.org/wiki/Busy_beaver
Requirements
You can install a web browser that supports at least JavaScript 1.0 (1995) to use this tool or you may consider implementing a GemiWeb0 browser with JavaScript0 yourself according to the following specification:bkil.gitlab.io/gemiweb0