Maze rule is a one-dimensional binary cellular automation. The simulation consists of a grid of cells, each of which can be in one of two states: alive or dead. At each step of the simulation, cells transition between these states according to rule B3/S12345:

• Birth (B3): A dead cell (state 0) with exactly 3 live neighbors becomes a live cell (state 1). This single condition is what "creates" new cells.
• Survival (S12345): A live cell (state 1) continues to live if it has 1, 2, 3, 4, or 5 live neighbors. This broad range allows for the creation of various stable structures.
• Death: In all other cases, cells die or remain dead.