Conway's Game of Life in Golang
Conway's Game of Life is a zero-player game - a cellular automaton simulation invented by John Horton Conway. There are many implementations in every important programming language here on GitHub. The map of a Game of Life consists of a two-dimensional grid of square cells. Each cell can have one of to two possible states - dead or alive. The future of a cell is determined by its own current status and that of the eight direct neighbors - vertically, horizontally and diagonally.
- a living cell with two or three living neighbors stays alive
- a dead cell with three living neighbors becomes a live cell
- every other cell will be a dead cell in the next round
01.gif
02.gif
03.gif
15.gif
