Harris Notes

Home

❯

concepts

❯

Cellular Automaton Grid

Cellular Automaton Grid

May 02, 20261 min read

  • concept
  • general
  • process

Cellular Automaton Grid

An infinite two-dimensional orthogonal grid of square cells, each holding a finite number of states (alive or dead), where each cell interacts with its eight immediate Moore neighbourhood neighbours at every time step.

Related

moore-neighbourhood cell-state-transitions game-of-life-rules john-horton-conway


Graph View

  • Cellular Automaton Grid
  • Related

Backlinks

  • Cell State Transitions
  • Emergent Pattern Formation
  • Game of Life Rules
  • Moore Neighbourhood
  • Zero-Player Simulation
  • John Horton Conway
  • Programming for Lovers
  • 20260502-1716-conway-s-game-of-life---programmatic-rules-and-par
  • index

Created with Quartz v4.5.2 © 2026

  • GitHub
  • Discord Community