An implementation of Conway's Game of Life.
- A neighbour is a cell horizontally, vertically or diagonally adjacent to the cell.
- A cell with life must have two or three neighbours to survive.
- Any empty cell comes to life if it have tree living neighbours.
The primary purpose of this repo is not to create an implementation of Conway's Game of Life. It's more about testing things. The collections of commits this update came with was mainly an excuse to try signing commits and get a TDD-setup running.