RISC-V Game of Life

gen 0

pop 0

density 0%

clusters 0

rate +0/-0

status idle

speed 12/s

grid

edges

patterns

rotate

settings

color

birth

survive

about

Conway's Game of Life: each cell lives or dies based on how many neighbors it has. You set up the initial state, hit run, and watch what happens.

The grid updates iteratively, one generation at a time. The cluster counter uses recursive flood fill to find connected groups. Both concepts show up all over the numerical codes we're porting to RISC-V this summer through the MIT mentorship (Numerical Recipes, HPC apps, ML kernels).

Patterns are named after real RISC-V tools: GCC cross-compiler, LLVM backend, QEMU, Spike ISA sim, OpenSBI firmware, and so on.

Iteration: stepGeneration() walks the grid cell by cell. Recursion: floodFill() finds connected clusters by visiting neighbors recursively.

pencil

import state