| 1 | Brian's Brain |
| 2 | ============= |
| 3 | |
| 4 | https://en.wikipedia.org/wiki/Brian%27s_Brain |
| 5 | https://en.wikipedia.org/wiki/Brian_Silverman |
| 6 | |
| 7 | > Brian's Brain is a cellular automaton devised by Brian Silverman, which is |
| 8 | > very similar to his Seeds rule. |
| 9 | > |
| 10 | > Rules |
| 11 | > ----- |
| 12 | > Brian's Brain consists of an infinite two-dimensional grid of cells, but |
| 13 | > unlike Seeds, each cell may be in one of three states: on, dying, or off. |
| 14 | > Each cell is considered to have eight neighbors (the Moore neighborhood), as |
| 15 | > in Seeds and Conway's Game of Life. |
| 16 | > |
| 17 | > In each time step, a cell turns on if it was off but had exactly two |
| 18 | > neighbors that were on, just like the birth rule for Seeds. All cells that |
| 19 | > were "on" go into the "dying" state, which is not counted as an "on" cell in |
| 20 | > the neighbor count, and prevents any cell from being born there. Cells that |
| 21 | > were in the dying state go into the off state. |