Game of Life with different update rules and on a bunch of different topologies (sphere, torus, klein bottle, etc.)
-
Updated
Nov 7, 2022 - Go
#
Cellular automaton
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.
Here are 11 public repositories matching this topic...
3d cellular automata with a GUI in GO!
-
Updated
May 31, 2022 - Go
A basic CLI implementation of Conway's Game of Life.
-
Updated
Oct 29, 2021 - Go
cellular automaton go module
-
Updated
Nov 9, 2023 - Go
A sand cellular automaton (Sand simulator)
-
Updated
Dec 26, 2024 - Go
Game of Life cellular automaton implemation in GoLang. (OpenGL Rendering)
-
Updated
Jan 17, 2018 - Go
A deterministic universe simulation playground written in Go. Experiment with gravity, electromagnetic forces, and cellular automaton.
-
Updated
Dec 14, 2022 - Go
🔬🎲 Go Cellular Automata
-
Updated
Jul 31, 2019 - Go
A graphical cellular automaton simulator, written in Go.
-
Updated
Sep 30, 2024 - Go
Created by Stanisław Ulam, John von Neumann
Released 1940
- Followers
- 4 followers
- Wikipedia
- Wikipedia