Game Of Life

This code kata is based on Conway's Game of Life

problem description

Given a input generation the goal of this kata is to calculate the next generation. The world consists of a two dimensional grid of cells, where each cell is either dead or alive.

For the purpose of this kata let's assume that the grid is finite and no life can exist off the edges.

Given a cell we define its eight neighbours as the cells that are horizontally, vertically, or diagonally adjacent.

When calculating the next generation you should follow these rules:

1. Any live cell with fewer than two live neighbours dies.
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.
4. Any dead cell with exactly three live neighbours becomes a live cell.

solution implementation

The initial state (the current generation) will be provided via a text file that specifies:

• the current generation number
• the grid size
• the population state (* represents a live cell, . represents a dead cell)

In the following input file example we can see an input file specifying the third generation on a 4 by 8 grid:

Generation 3:
4 8
........
....*...
...**...
........

The output should display the correct number of the resulting generation, the grid size (this will always be the same as the one specified in the input file) and the current population state. Given the example above, the expected output would be this:

Generation 4:
4 8
........
...**...
...**...
........

Notes

• Implement the requirements focusing on writing the best code you can produce.
• When ready share with us a git repo (github/gitlab) with your solution.
• Feel free to provide a console application, web application, whatever!