Elementary Cellular Automaton Rules by Gray Code

Neighboring tiles evolve according to elementary cellular automaton rules that differ by one bit if Gray ordering is selected. Compare the 256 results for all elementary rules obtained from selected initial conditions of width nine. The initial conditions can be selected by ordinary enumeration order or by Gray code order, in which neighboring initializations differ by exactly one bit.

THINGS TO TRY

SNAPSHOTS

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

RELATED LINKS

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