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.
A remake of the game "Cell Machine" written in JavaScript.
Very simple cellular automaton.
A super powerful Typescript library for cellular automation
Virtual chemistry simultaion. Particle automata. Visualization of the behavior of particles in 2D and 3D space. Artifical life research.
Cellular automatons in TypeScript.
Cell automaton single page app, built using React
Conway's Game of Life
Browser implementation of Conway's Game of Life
A recreation of minecraft redstone with cellular automaton
Unidimensional Cellular Automata Explorer managing _arbitrary rules_
Game of Life playground with features such as changeable rules, generation rules included, etc.
Conway's Game of Life in a terminal - Class 4 Cellular Automaton
Encode and decode secret messages in cellular automata.
Cellular automata simulation
Conway’s Game of Life (TypeScript + React (+ Jest))
Project to demonstrate the principle of emergence using elementary cellular automaton
A cellular automaton (CA) explorer to understand and unveil properties of CA in 1D.
Simulation of a droid moving around a cellular network
Web applications I developed for fun
Created by Stanisław Ulam, John von Neumann
Released 1940