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.
Simulation of Nagel and Schreckenberg's cellular automaton model for freeway traffic simulation
A Cellular Automaton Simulator written in Kotlin / Java
Diffusion-limited aggregation (DLA) is the process whereby particles undergoing a random walk due to Brownian motion cluster together to form aggregates of such particles.
Wolfram's Elementary Cellular Automaton Generator using Java
The Game of Life is played on a two-dimensional rectangular grid of cells. Each cell can be either alive or dead.
A program that lets you play around with various cellular automata to see how they evolve in real time.
Using a 2D cellular automata and parallel computing to simulate the Belousov Zhabotinsky reaction.
Graph-driven Cellular Automata, with options for cell mutation, automatic picture saving, and scheduled event handling. Also used to create images for the coloring book Control Alt Color
Conway's Game Of Life in Java 8 with the JavaFX UI tools. This is not the board game, but the Turing-complete cellular automaton invented by the mathmatician John Conway in 1970.
The goal of this project is to test the capabilities of ChatGPT, a chatbot powered by a large language model trained by OpenAI, by using it to write a cellular automaton simulator program.
Conway's Game Of Life implemented in Java
Generador de laberintos usando un autómata celular. Implementa varias ruleStrings, siendo B3/S1234(Mazectric) la mejor para generar laberintos.
Automaton for simulating evacuation of pedestrians.
Implementação do Autômato Celular Elementar de Wolfram em Java com Swing
An updated version of the ebola simulator, using object oriented design patterns to make the visualisation program more efficient
This repo contains a java implementation of 1 Dimensional CA with 3 Colors (White, Black, Gray)
Simulator of a 1D cellular automata, being able to choose diferent parameters, rules and visualization through a GUI.
Created by Stanisław Ulam, John von Neumann
Released 1940