A Collatz-inspired cellular automaton where life and death are governed by integer dynamics rather than fixed Conway rules.
Abidin's Game of Death is an experimental two-dimensional cellular automaton inspired by:
- Conway's Game of Life
- The Collatz Conjecture (3n + 1)
- Cellular automata
- Integer dynamics
- Emergent systems
Unlike Conway's Game of Life, this automaton does not use simple neighbor counts.
Every cell carries an integer state.
During each generation, neighboring cells interact through Collatz transformations, producing new candidate states. Survival is then determined dynamically using percentile thresholds.
The result is an evolving system that often produces organic-looking structures, clusters and wave fronts while remaining mathematically driven.
- Interactive Tkinter GUI
- Real-time simulation
- Collatz-based evolution rules
- Integer-valued cell states
- Multiple seed patterns
- Adjustable simulation speed
- Grid on/off
- Toroidal wrapping
- Multiple color palettes
- Percentile survival rule
- Percentile color mapping
- PNG export
- Live statistics panel
- Stopping-time visualization
Instead of counting neighbors like Conway:
2-3 -> survive
3 -> birth
this project computes a new integer state.
For every cell:
- Collect 8 neighboring cells
- Apply one Collatz step to every live neighbor
- Sum transformed values
- Generate a candidate state
- Compute the selected percentile over the active field
- Compare the candidate against that threshold
candidate <= threshold
↓
Death
candidate > threshold
↓
Alive
This makes the automaton adaptive.
The survival threshold changes automatically as the system evolves.
Maps stopping times according to their percentile.
Advantages:
- Uses the entire palette
- Better visual contrast
- Adapts automatically
- Suitable for exploration
Maps stopping time using a logarithmic scale.
Advantages:
- Preserves absolute differences
- Stable across generations
- Useful for analysis
| Control | Description |
|---|---|
| Start | Start simulation |
| Stop | Stop simulation |
| Step | Single generation |
| Random | Generate random world |
| Seed | Load predefined pattern |
| Life Percentile | Survival threshold |
| Palette | Select color palette |
| Color Mode | Percentile or Log scale |
| Grid | Toggle grid |
| Wrap | Toroidal world |
| Export | Save PNG |
- Abidin Spiral
- R-pentomino
- Collatz Cross
- Prime Sparks
- Nebula
The right panel displays:
- Generation
- Alive cells
- Births
- Deaths
- Average state
- Maximum state
- Life percentile
- Threshold
- Simulation speed
The purpose of this project is not to reproduce Conway's Game of Life.
Instead, it explores what happens when
- integer dynamics,
- Collatz transformations,
- adaptive thresholds,
- and cellular automata
are combined into a single simulation.
The resulting behavior is intentionally different from Conway's original universe.
- Python 3
- Tkinter
- NumPy
- Pillow
git clone https://github.com/SKR-35/Abidin-s-Game-of-Death.git
cd Abidin-s-Game-of-Deathconda create -n automata python=3.12conda activate automatapip install -r requirements.txtpython abidins_game_of_death.pyconda deactivate- GPU acceleration
- 3D automata
- Additional integer rules
- Prime-number universes
- Multi-state automata
- Custom rule editor
- GIF / MP4 recording
Dedicated to the memory of Abidin.
