Skip to content

eliasjoby/CellAutomata-Forge

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

🧬 Conway's Game of Life: A Study in Universal Computation

An optimized web-based implementation of the legendary cellular automaton devised by John Horton Conway. This "zero-player" simulation demonstrates how complex, organic patterns and emergent behaviors can arise from a set of simple, deterministic rules.


🧠 Behind the Project

This implementation sits at the intersection of academic theory and digital curiosity. It was developed to explore the profound implications of Cellular Automata:

  • Theory of Computation (NITC): Built as a practical exploration for my coursework at the National Institute of Technology Calicut. It serves as a visual gateway into understanding the Church-Turing Thesis and how local state transitions can reach the heights of Turing Completeness.
  • Veritasium Inspiration: Heavily influenced by the video "Math's Fundamental Flaw", which explores Gödel's Incompleteness Theorem and the fascinating realization that systems like the Game of Life are capable of performing any calculation possible by a modern computer, effectively acting as a Universal Turing Machine.

The Laws of Nature

The simulation progresses in discrete time-steps called ticks. During each tick, the state of the entire grid is updated simultaneously based on four fundamental laws:

  1. Isolation: Any living cell with < 2 living neighbors dies (underpopulation).
  2. Stability: Any living cell with 2 or 3 living neighbors survives.
  3. Overcrowding: Any living cell with > 3 living neighbors dies (overpopulation).
  4. Genesis: Any dead cell with exactly 3 living neighbors becomes a live cell (reproduction).

Technical Implementation

  • Double-Buffering Logic: To ensure the rules are applied simultaneously across the grid, the simulation uses a dual-grid approach, preventing state mutation during the calculation of the next generation.
  • Heatmap & Persistence: Includes an Aging Effect (Heatmap) that tracks the "persistence" of cells. Newborn cells appear in vibrant mint green, while established cells transition into deeper teal shades, visualizing the history of the "seed."
  • Performance Optimized: Designed to handle high-frequency updates and large grids for fluid visualization.

Exploration

  1. The Seed: Manually toggle cells or use the Randomize tool to create an initial state.
  2. Trace Mode: Enable the trace feature to visualize the path and movement of patterns like Gliders and Oscillators.
  3. Observation: Look for emergent structures such as "Still Lifes" (Block, Beehive), "Oscillators" (Blinker, Pulsar), and "Spaceships" (Glider, LWSS).

Author

Elias Joby Computer Science & Robotics

Reference: Wikipedia

Project Website

About

Interactive studio for building and exploring cellular automata simulations including Conway’s Game of Life

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors