This implementation is a Rust solution put together on a sleepless morning by Matthew Walton. Thanks to my cat for getting me in the mood for some coding.
Written on Rust 1.28, but probably works back to 1.22 (untested, but I do use the Try impl on Option<T> which was introduced in 1.22).
This was presented as a PreparedKata at XP2005, by Emmanuel Gaillot.
- Difficulty - medium
- Language - Any - preferably one out of your comfort zone.
- Solution should ideally be test-driven
- Prove your solution with a variation of inputs
This Kata is about calculating the next generation of Conway's game of life, given any starting position. See http://en.wikipedia.org/wiki/Conway%27s_Game_of_Life for background.
You start with a two dimensional grid of cells, where each cell is either alive or dead. In this version of the problem, the grid is finite, and no life can exist off the edges. When calcuating the next generation of the grid, follow these rules:
- Any live cell with fewer than two live neighbours dies, as if caused by underpopulation.
- Any live cell with more than three live neighbours dies, as if by overcrowding.
- Any live cell with two or three live neighbours lives on to the next generation.
- Any dead cell with exactly three live neighbours becomes a live cell.
You should write a program that can accept an arbitrary grid of cells, and will output a similar grid showing the next generation.
The input starting position could be a text file that looks like this:
Generation 1:
4 8
........
....*...
...**...
........
And the output could look like this:
Generation 2:
4 8
........
...**...
...**...
........
The input format is similar to that in KataMinesweeper, and is easily parsed in most languages.