Searches for Busy Beaver programs in (a variant of) the 2L programming language
https://github.com/erwinbonsma/BusyBeaverFinder.git
This program searches for Busy Beavers programs in (a variant of) the 2L language.
The language is two-dimensional. The instructions are put on a 2D grid whose size is limited. The directional program pointer (PP) moves across this grid, executing instructions as it encounters them. It starts just below the left-most cell at the bottom of the grid, moving upwards.
There is also a one-dimensional, infinite tape that acts as data. All cells of the tape are initially filled with zeros. The data pointer (DP) points to one of these cells.
The language consist of only two symbols:
The program terminates when PP leaves the board.
The differences of the above language with respect to the original 2L language are:
Find a program that executes for as long as possible, yet terminates.
For a detailed description of the search algorithm and its current results check my write-up The Quest for 2LBB Busy Beavers.