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
(Created page with "{{Infobox GB Homebrews |title=GB Life |image=gblife.png |description=A purely observational Conway's Game of Life demo. |author=Luc Van den Borre |lastupdated=1998/01/17 |type=Other Apps |version=2 |format=DMG-GBDK |license=Mixed |download=https://dlhb.gamebrew.org/gbhomebrews/gblife.7z |website=https://web.archive.org/web/20000815225059/http://vandenborre.org/old/ |source=gblife.7z |donation= }} {{#seo: |title= (Other Apps) - GameBrew |title_mode=append |image=gblife.pn...")
 
No edit summary
Line 11: Line 11:
|download=https://dlhb.gamebrew.org/gbhomebrews/gblife.7z
|download=https://dlhb.gamebrew.org/gbhomebrews/gblife.7z
|website=https://web.archive.org/web/20000815225059/http://vandenborre.org/old/
|website=https://web.archive.org/web/20000815225059/http://vandenborre.org/old/
|source=gblife.7z
|source=https://dlhb.gamebrew.org/gbhomebrews/gblife.7z
|donation=
|donation=
}}
}}

Revision as of 03:28, 10 September 2023

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

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

User guide

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: