Game of Life

Instructions

The universe of the Game of Life is a two-dimensional grid of cells, each of which is in one of two possible states, live 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 live cell with fewer than two live neighbours dies, as if by underpopulation.
2. Any live cell with two or three live neighbours lives on to the next generation.
3. Any live cell with more than three live neighbours dies, as if by overpopulation.
4. Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.

The initial pattern constitutes the seed of the system. The first generation is created by applying the above rules simultaneously to every cell in the seed, live or dead; births and deaths occur simultaneously, and the discrete moment at which this happens is sometimes called a tick.

The rules continue to be applied repeatedly to create further generations.

You should write a program that can accept an arbitrary grid of cells, and will output a similar grid showing the next generation.

Example

Generation 1:
........
....*...
...**...
........

Generation 2:
........
...**...
...**...
........

Solutions

• Kotlin by Nicolás Bottarini