Command Line Elementary Cellular Automata
-
Updated
Nov 7, 2021 - C
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.
Command Line Elementary Cellular Automata
Rule 110 Simulator in Brainfuck
GPU-accelarated Game of Life simulation capable of running very large patterns such as the digital clock in real-time.
Multi-threaded library for cellular automata
Minimal library implimentation for a shader based game of life simulation
game of life proposed by Conway, I just programmed it because it seemed pretty awesome
Conway's Game of Life in C/OpenGL
Conway's Game of Life on MS-DOS
A simple and rough simulation of forest fires on the windows console. It would probably make for a cool screen-saver.
Two cellular automata (Physarum polycephalum, reaction–diffusion).
Simple implementation of John Conway's cellular automaton with wraparound topology and fancy animations
3d Cellular Automata rendered using an efficient raymarching algorithm.
Predator-prey ecosystem cellular automaton
Sand/water/smoke simulation on a grid
An ASCII Powder Toy clone / game engine
The HPP cellular automaton for fluid propagation, parallely computed.
Created by Stanisław Ulam, John von Neumann
Released 1940