Multi-threaded library for cellular automata
-
Updated
Oct 11, 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.
Multi-threaded library for cellular automata
A simple and rough simulation of forest fires on the windows console. It would probably make for a cool screen-saver.
A falling sand game made in C using the minilibX as the API
GPU-accelarated Game of Life simulation capable of running very large patterns such as the digital clock in real-time.
An ASCII Powder Toy clone / game engine
Simple implementation of John Conway's cellular automaton with wraparound topology and fancy animations
Rule 110 Simulator in Brainfuck
The program is a C console application that runs Conway's Game of Life, a cellular automaton invented by the British mathematician John Horton Conway in 1970.
Code for one and two dimensional cellular automata
Diffusion-limited aggregation cellular automaton
Two cellular automata (Physarum polycephalum, reaction–diffusion).
game of life proposed by Conway, I just programmed it because it seemed pretty awesome
Conway's Game of Life in C/OpenGL
The HPP cellular automaton for fluid propagation, parallely computed.
Minimal library implimentation for a shader based game of life simulation
Celllular automaton with implimentation of conway's game of life
Created by Stanisław Ulam, John von Neumann
Released 1940