https://github.com/gsurma/game_of_life
NetLogo implementation of Conway's Game Of Life.
https://github.com/gsurma/game_of_life
conway-game conways-game-of-life game-of-life life netlogo netlogo-example
Last synced: 8 months ago
JSON representation
NetLogo implementation of Conway's Game Of Life.
- Host: GitHub
- URL: https://github.com/gsurma/game_of_life
- Owner: gsurma
- License: mit
- Created: 2019-06-02T11:07:51.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2021-07-09T08:58:56.000Z (over 4 years ago)
- Last Synced: 2025-01-19T11:15:02.759Z (10 months ago)
- Topics: conway-game, conways-game-of-life, game-of-life, life, netlogo, netlogo-example
- Language: NetLogo
- Homepage: https://gsurma.github.io
- Size: 95.7 KB
- Stars: 6
- Watchers: 3
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Funding: .github/FUNDING.yml
- License: LICENSE
Awesome Lists containing this project
README
# Game of Life
NetLogo implemetation of [John Horton Conway](https://en.wikipedia.org/wiki/John_Horton_Conway)'s [Game Of Life](https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life).
## Rules
The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, alive or dead, (or populated and unpopulated, respectively). 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 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 overpopulation.
Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.
## Examples
## Author
**Greg (Grzegorz) Surma**
[**PORTFOLIO**](https://gsurma.github.io)
[**GITHUB**](https://github.com/gsurma)
[**BLOG**](https://medium.com/@gsurma)