|
gptkbp:instanceOf
|
cellular automaton
|
|
gptkbp:alternativeName
|
gptkb:Conway's_Game_of_Life
|
|
gptkbp:category
|
gptkb:mathematics
computer science
|
|
gptkbp:createdBy
|
gptkb:John_Horton_Conway
|
|
gptkbp:firstPublished
|
1970
|
|
gptkbp:hasCellState
|
alive
dead
|
|
gptkbp:hasGridType
|
infinite two-dimensional orthogonal grid
|
|
gptkbp:hasLanguage
|
English
|
|
gptkbp:hasProperty
|
Turing complete
|
|
gptkbp:hasRule
|
Any live cell with two or three live neighbours survives.
Any dead cell with three live neighbours becomes a live cell.
All other live cells die in the next generation. Similarly, all other dead cells stay dead.
|
|
gptkbp:hasWebsite
|
https://conwaylife.com/
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
The Game of Life
|
|
gptkbp:influenced
|
complex systems
computer simulations
artificial life research
|
|
gptkbp:mediaType
|
gptkb:logic
gptkb:simulation
|
|
gptkbp:pattern
|
gptkb:aircraft
gptkb:satellite
oscillator
shooting
turtle
still life
pulsar
beacon
blinker
|
|
gptkbp:publishedIn
|
gptkb:Scientific_American
|
|
gptkbp:bfsParent
|
gptkb:Milton_Bradley_Company
gptkb:Hasbro_Gaming
gptkb:Hasbro_games
gptkb:Exo-Psychology
|
|
gptkbp:bfsLayer
|
6
|