In this example application will run glider pattern on 25*25 grid.
To run, you need to do the following steps:
mvn clean install
java -jar target/gameoflife-1.0-SNAPSHOT-jar-with-dependencies.jar
The universe of the Game of Life is an infinite twodimensional orthogonal grid of squarecells, each of which is in one of two possible states, 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:
- Any live cell with fewer than two live neighbours dies, as if caused by underpopulation.
- Any live cell with two or three live neighbours lives on to the next generation.
- Any live cell with more than three live neighbours dies, as if by overcrowding.
- 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—births and deaths occur simultaneously, and the discrete moment at which this happens is sometimes called a tick (in other words, each generation is a pure function of the preceding one). The rules continue to be applied repeatedly to create further generations.
- Implement game of life data structures and algorithm
- Demonstrate that game of life algorithm works
Note: the program has to run and work properly (working program is better than inprogress design). Note: use ‘Glider’ pattern placed in the middle of 25x25 cell universe for demonstration.