A collection of algorithms for generating cellular automata. Currently only contains "elementary cellular automata" or aka the cool pictures from the Wolfram book. Provides a Automata::Elementary class that takes rule number, initial state along with a #run(steps) method. Produces an array of strings as a result.

Required Ruby Version

None

Authors

Michael Garriss

Versions

  1. 0.1.0 December 27, 2011 (4 KB)

SHA 256 checksum