Programming.ConwayLife History

Hide minor edits - Show changes to output - Cancel

February 28, 2014, at 10:17 AM by MichaelPaulukonis -
Added lines 31-33:
[[CellularAutomata]] (CL is really a subset of CA)

January 21, 2014, at 03:25 PM by OtherMichael -
Changed lines 5-6 from:


Added lines 20-25:

[[|variations on the game of life]]
[[|Conway's Game of Life]]
[[|Games of Life in color]]

January 21, 2014, at 09:56 AM by OtherMichael -
Added lines 14-18:

!! Linkdump
[[]] which refers to [[Wikipedia:Gosper's_algorithm]] and a google search suggests [[|Gosper's Algorithm (Hashlife)]], ''An explanation of how the hashlife algorithm reduces processing time and effort for cellular automata evaluation.''
January 21, 2014, at 09:47 AM by OtherMichael -
Added lines 1-21:
(:description cellular automata :)
!! First heading


!! Basic Rules
# Any live cell with fewer than two live neighbours dies, as if caused by under-population.
# 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 overcrowding.
# Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.

!! See Also
Rudy Rucker et alia

[[#tags]] [[#categories]]
!! Category tags