No, this is not the board game. This game is John Conway's Game of Life - ASCII version. This game is a zero player game - a cellular automaton - a "discrete model studied in computability theory, mathematics, physics,...
No, this is not the board game. This game is John Conway's Game of Life - ASCII version. This game is a zero player game - a cellular automaton - a "discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modeling. Cellular automata are also called cellular spaces, tessellation automata, homogeneous structures, cellular structures, tessellation structures, and iterative arrays. "
"A cellular automaton consists of a regular grid of cells, each in one of a finite number of states, such as on and off (in contrast to a coupled map lattice). The grid can be in any finite number of dimensions. For each cell, a set of cells called its neighborhood (usually including the cell itself) is defined relative to the specified cell. An initial state (time t=0) is selected by assigning a state for each cell. A new generation is created (advancing t by 1), according to some fixed rule (generally, a mathematical function) that determines the new state of each cell in terms of the current state of the cell and the states of the cells in its neighborhood. Typically, the rule for updating the state of cells is the same for each cell and does not change over time, and is applied to the whole grid simultaneously, though exceptions are known, such as the probabilistic cellular automata and asynchronous cellular automaton.
The concept was originally discovered in the 1940s by Stanislaw Ulam and John von Neumann while they were contemporaries at Los Alamos National Laboratory. While studied some throughout the 1950s and 1960s, it was not until the 1970s and Conway's Game of Life, a two-dimensional cellular automaton, that interest in the subject expanded beyond academia. In the 1980s, Stephen Wolfram engaged in a systematic study of one dimensional cellular automata, or what he calls elementary cellular automata, showing that some of the rule sets were Turing-complete. He published A New Kind of Science in 2002, claiming that cellular automata have applications in many fields of science."
Previous Versions
Here you can find the changelog of ASCII Game of Life since it was posted on our website on 2017-01-03 02:46:27.
The latest version is 1.0 and it was updated on 2024-04-03 18:23:25. See below the changes in each version.
ASCII Game of Life version 1.0
Updated At: 2012-12-17
Changes: *** Version 1.0 ***
Includes a fixed size grid, with fixed duration generations. No other features available. The grid is randomly seeded any time the application resumes (whenever it is no longer in view, then is brought back into view).
*** Upcoming Features ***
Configurations - choose generation speed, draw cells though touch, pause and resume generation tick, change symbol representing each cell, change colors.
Related Apps
Here you can find apps that are similar with ASCII Game of Life.
We do not host ASCII Game of Life on our servers. We did not scan it for viruses, adware, spyware or other type of malware. This app is hosted by Galad and passed their terms and conditions to be listed there. We recommend caution when installing it.
The APK Download link for ASCII Game of Life is provided to you by apps112.com without any warranties, representations or guarantees of any kind, so access it at your own risk.
If you have questions regarding this particular app contact the publisher directly. For questions about the functionalities of apps112.com contact us.
