The Wayback Machine - https://web.archive.org/web/20200917010935/https://github.com/jsgoller1/game-of-life
Skip to content
master
Go to file
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

README.md

game-of-life

Simple implementation of Conway's Game of Life with ncurses:

Rules:

In an N x M grid of cells, a cell is "alive" if it contains X and "dead" if it contains .. On each iteration of the game, every cell is evaluated simultaneously according to the following rules (a cell's neighbors are any cells adjacent to it, including diagonals):

  1. Any live cell with fewer than two live neighbors dies, as if by under population.
  2. Any live cell with two or three live neighbors lives on to the next generation.
  3. Any live cell with more than three live neighbors dies, as if by overpopulation.
  4. Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.

Running

make gol. The following patterns are supported:

  • still lifes:
    • --block
    • --beehive
    • --loaf
    • --boat
    • --tub
  • oscillators:
    • --blinker
    • --toad
    • --beacon
  • spaceships:
    • --glider
    • --lwss
  • big:
    • --penta
    • --pulsar
  • guns:
    • --gosper-stable
    • --gosper-unstable

Requirements

Must have ncurses installed.

Special thanks

About

Conway's game of life

Topics

Resources

Releases

No releases published

Packages

No packages published
You can’t perform that action at this time.