# Hexagonal Two-Color Four-Neighbor Totalistic Cellular Automata

Hexagonal Two-Color Four-Neighbor Totalistic Cellular Automata

This Demonstration explores the rule space of two-color, four-neighbor, totalistic cellular automata on a hexagonal grid. There are =32 different rules in total. For each rule, you can choose a single black cell initial condition and a variety of random initial conditions. For each initial condition, a density chart of black cells is drawn over the first 50 steps of evolution.

5

2