Experiment implementation of Multiple Neighborhoods Cellular Automata using WebGPU
-
Updated
Feb 4, 2023 - TypeScript
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.
Experiment implementation of Multiple Neighborhoods Cellular Automata using WebGPU
Cellular automata with dynamic rulesets in WebGL
Agent-based modeling in JavaScript in the browser or on the server.
A remake of the game "Cell Machine" written in JavaScript.
Cellular automata simulation
A Three.js webapp to simulate cellular automata in 3D
🧬 Web GPU-accelerated cellular automata playground simulating artificial life patterns with customizable interactions.
Plant growth simulation by cellular neural network.
🌱 Modern, intuitive, WebGPU-powered toolkit for creating your own cellular automata.
Conway's Game of Life in Next.js
A super powerful Typescript library for cellular automation
Langton's ant simulator with a extensive rules editor.
Cellular Automata and Conways Game of Life in React
Extensible and efficient web application for exploring cellular automata
🧫 Cellular Automata
Cellular Automata demonstration in React.
Pixel Simulations. Includes a minimal testing framework (scuffed)
Sam Hogan's Cell Machine, now on MakeCode Arcade!
Created by Stanisław Ulam, John von Neumann
Released 1940