This is a collection of interactive simulations for various cellular automata models, including Amoeba, Game of Life, and more. It provides real-time visualization of the grid evolution, allowing users to explore different patterns and behaviors of these automata.
A collection of cellular automata simulations implemented using Processing.org. To run the project, make sure to use Python mode in Processing for proper execution and visualization of grid evolution.
This project features four unique games:
- Amoeba
- Brian's Brain
- Game of Life
- Larger Than Life
each demonstrating distinct rules and behaviors for cellular automata.
- Interactive Visualization: Dynamic, grid-based simulations with color-coded states for easy visualization.
- Four Cellular Automata Games:
- Amoeba: Simulates organic-like growth patterns with unique rules.
- Brian's Brain: A three-state cellular automaton with "on," "dying," and "off" cells.
- Game of Life: Conway's famous simulation of life and death based on simple neighbor-count rules.
- Larger Than Life: A generalized automaton with custom rules for more complex patterns.
- The grid is initialized with random states or a preset configuration.
- Each simulation computes the next generation based on its specific rules.
- Color-coded grids visually represent the changes in real time.
- Blue: "Off" or inactive.
- White: Neutral or empty state.
- Yellow: Cells being compared or in transition.
- Red: Cells marked for change (e.g., "Dying").
- Black: Cells in an active state (e.g., "On").
- Generates organic, amoeba-like growths and contractions.
- Simulates dynamic and organic growth patterns.
- Rules are tailored to produce self-sustaining patterns.
- Produces glowing wave-like patterns that resemble firing neurons.
- Each cell has three states: On (blue), Dying (red), and Off (white).
- Rules:
- Off → On if exactly two neighbors are "On."
- On → Dying in the next step.
- Dying → Off in the subsequent step.
- A classic cellular automaton invented by John Conway.
- Each cell can be Alive (black) or Dead (white).
- Rules:
- Dead → Alive if it has exactly three live neighbors.
- Alive → Dead if it has fewer than two or more than three live neighbors.
- Alive → Alive if it has two or three live neighbors.
- Behavior: Creates large, intricate patterns.
- A generalization of Conway's rules, allowing larger neighborhoods.
- Birth: A dead cell (0) turns "on" (1) if it has 3, 4, 5, 6, 7, or 8 neighbors that are "on."
- Survival: An "on" cell (1) remains "on" if it has 3, 4, 5, 6, 7, or 8 neighbors that are "on."
- Death: All other cells turn "off."
- Download and install Processing [use Python Mode]
- Clone this repository or download the ZIP file:
git clone https://github.com/kmusadiqpasha/cellular-automata-visualizer
- Open the .pde files for each simulation in Processing.
- Run the sketches and watch the cellular automata come to life!
- This project is licensed under the MIT License - see the LICENSE file for details.