Conway's Game of Life as Undirected Graph

Graph-Based Game of Life

This interactive simulation is a graph-based variation of Conway's Game of Life. Instead of a grid, each cell is a node in a dynamic, undirected graph. Nodes represent living (black) or dead (white) entities, and edges represent "neighbor" relationships.

Rules of Life

• Alive nodes (black) stay alive if they have 2 or 3 living neighbors.
• Alive nodes die if they have fewer than 2 or more than 3 living neighbors.
• Dead nodes (white) do not revive.
• When 3 living neighbors cause a birth, a new node is created and connected to those parents.

Controls

• Start / Stop: Begin or pause the simulation.
• Randomize: Randomize alive states.
• Clear: Set all nodes to dead.
• Drag: Reposition nodes.

Simulation speed (ms): 1000 ms Start Stop Randomize Clear
Max Steps:

Step Count: 0

Start Over