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 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.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


The hexagon tiling may result in slow performance at large steps. Try dot tiling if that happens.
This Demonstration was created during the New Kind of Science Summer School 2008 in Burlington, Vermont.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.