Toggle menu
Toggle personal menu
Not logged in
Your IP address will be publicly visible if you make any edits.

GB Life: Difference between revisions

From GameBrew
No edit summary
No edit summary
Line 2: Line 2:
|title=GB Life
|title=GB Life
|image=gblife.png
|image=gblife.png
|description=A purely observational Conway's Game of Life demo.
|description=A purely observational Conways Game of Life demo.
|author=Luc Van den Borre
|author=Luc Van den Borre
|lastupdated=1998/01/17
|lastupdated=1998/01/17

Revision as of 13:01, 11 July 2024

GB Life
Gblife.png
General
AuthorLuc Van den Borre
TypeSimulation
Version2
LicenseMixed
SystemDMG
Last Updated1998/01/17
Links
Download
Website
Source

Written in C using the GBDK, this is a simple implementation of the classic cellular "game".

Conway's Game of Life is a cellular automaton devised by mathematician John Conway in 1970. It consists of a grid of cells, each in one of two states: alive or dead. The state of a cell evolves in discrete time steps based on simple rules.

A living cell survives if it has two or three living neighbors; otherwise, it dies due to underpopulation or overpopulation. A dead cell becomes alive if it has exactly three living neighbors.

In this demo, there is no gameplay or control; it is purely observational, allowing you to watch the patterns unfold.

Screenshots

gblife2.png gblife3.png

External links

Advertising: