Please in order to save solutions and appear on the leaderboards.

Game of Life Authors

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:

  1. Any dead cell with exactly three live neighbours becomes a live cell.
  2. All other dead cells stay dead.
  3. Any live cell with two or three live neighbours survives.
  4. 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 solution
All
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output.
TeX is an experimental language, no solutions will be saved. Please leave feedback on the GitHub issue.
ctrl + enter or

Delete Solution

Are you sure you want to delete your solution(s) for Game of Life?

If you have seperate bytes and chars solutions then both will be deleted.

This is irreversible, please backup any code you care about.

Type I understand and press confirm to continue.