A cellular automaton is a discrete model of computation studied in automata theory.
It consists of a regular grid of cells, each in one of a finite number of states; a new generation is created according to some fixed rule that determines the new state of each cell in terms of the current state of the cell and 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 stochastic cellular automaton and asynchronous cellular automaton.
A well-known cellular automaton is Conway’s Game of Life.
Virtual chemistry simultaion. Particle automata. Visualization of the behavior of particles in 2D and 3D space. Artifical life research.
A remake of the game "Cell Machine" written in JavaScript.
Unidimensional Cellular Automata Explorer managing _arbitrary rules_
Very simple cellular automaton.
Cellular automata simulation
A super powerful Typescript library for cellular automation
Conway’s Game of Life (TypeScript + React (+ Jest))
Extensible and efficient web application for exploring cellular automata
Game of Life playground with features such as changeable rules, generation rules included, etc.
A cellular automaton (CA) explorer to understand and unveil properties of CA in 1D.
Cell automaton single page app, built using React
Conway's Game of Life in a terminal - Class 4 Cellular Automaton
Reading and Writing Conway Game of Life Files
Cellular automatons in TypeScript.
A recreation of minecraft redstone with cellular automaton
Browser implementation of Conway's Game of Life
Conway's Game of Life
Project to demonstrate the principle of emergence using elementary cellular automaton
Simulation of a droid moving around a cellular network
Created by Stanisław Ulam, John von Neumann
Released 1940