⚠️ NOTE:️ WebGPU is not working in your browser ⚠️
Game of Life-like simulations using WebGPU. See the source code for details.
Life-like simulations consists of a grid of cells. Each cell is alive or dead - initially at random.
A new generation is computed from the current one using a rule - a function that given the the current state of the cell and the number of alive neighbours determines if the cell will be alive in the next generation.
A rule of the form B3/S1234 (Conway's Game of Life, the most famous rule) means that a dead cell is reborn if it has 3 live neighbors, while a live cell will survive if it has 1, 2, 3 or 4 live neighbors.
Rule:
Grid size:
Initial density:
Generations / second: