Game of Life
Details
The universe of the Game of Life is a grid of square cells, each of which is either alive ("#") or dead ("."). Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur:
- Any dead cell with exactly three live neighbours becomes a live cell.
- All other dead cells stay dead.
- Any live cell with two or three live neighbours survives.
- All other live cells die.
Given a 32×32 grid, output the state in the next step. Assume that every cell outside the grid is dead.
0 bytes, 0 chars
Restore solutionCompiled from
AT&T syntax to x86-64 Linux. Use
syscalls to write output.
Arturo is an experimental language, no solutions will be saved.
Please leave feedback on the
GitHub issue.
Fennel is an experimental language, no solutions will be saved.
Please leave feedback on the
GitHub issue.
Uiua is an experimental language, no solutions will be saved.
Please leave feedback on the
GitHub issue.
ctrl + enter or