
## Conway's Rules with One Change

I built this simulation to see what happens when Conway's Game of Life gets a small source of randomness. Each turn gives every cell a slight chance to switch state, so stable patterns eventually move or disappear.

## Source Code

The <a href="https://github.com/ShameekConyers/sic-game-of-life">source code</a> is on GitHub.

<img src="/projects/cellular_automata/figures/gol_main.gif"
alt="Animated grid showing the Game of Life simulation" width="600" height="400" />

---

## Game

Unpause the simulation and click the grid to place live cells. The mutation rule prevents settled patterns from remaining static forever.

## Installation

Download the repository and run the executable for your operating system.

## Implementation Details

The C++ simulation code is in `root/src`. The Godot interface and GDScript code are in `godot`.


A C++ and Godot implementation of Conway's Game of Life with a small mutation rule.

Cellular Automata

Conway's Rules with One Change

Source Code

Game

Installation

Implementation Details