Cargando…
Game of Life Cellular Automata
In the late 1960s, British mathematician John Conway invented a virtual mathematical machine that operates on a two-dimensional array of square cell. Each cell takes two states, live and dead. The cells' states are updated simultaneously and in discrete time. A dead cell comes to life if it has...
Autor principal: | |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
2010
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/1412703 |
Sumario: | In the late 1960s, British mathematician John Conway invented a virtual mathematical machine that operates on a two-dimensional array of square cell. Each cell takes two states, live and dead. The cells' states are updated simultaneously and in discrete time. A dead cell comes to life if it has exactly three live neighbours. A live cell remains alive if two or three of its neighbours are alive, otherwise the cell dies. Conway's Game of Life became the most programmed solitary game and the most known cellular automaton. The book brings together results of forty years of study into computational |
---|