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)
[[Processing#cellular]]

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

to:
[[http://www.conwaylife.com/]]
[[http://www.conwaylife.com/wiki/]]

Added lines 20-25:

[[http://www-cs-faculty.stanford.edu/~eroberts/courses/soco/projects/2008-09/modeling-natural-systems/gameOfLife2.html|variations on the game of life]]
[[http://www.math.cornell.edu/~lipa/mec/lesson6.html|Conway's Game of Life]]
[[http://www.math.kth.se/~gunnarj/LIFE/WLIF/wlcframes.html|Games of Life in color]]

[[http://www.conwaylife.com/wiki/Colourised_life]]
 
 
January 21, 2014, at 09:56 AM by OtherMichael -
Added lines 14-18:


!! Linkdump
[[http://stackoverflow.com/questions/40485/optimizing-conways-game-of-life]]
[[http://programmers.stackexchange.com/questions/50175/conways-game-of-life-c]] which refers to [[Wikipedia:Gosper's_algorithm]] and a google search suggests [[http://www-users.cs.york.ac.uk/~jowen/hashlife.html|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]]
!! First heading
[[Wikipedia:Conway's_Game_of_Life]]


Attach:Gospers_glider_gun.gif

!! 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.


[[#seealso]]
!! See Also
Rudy Rucker et alia

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