Simple implementation of Wolfram's 1D Cellular Automata The system is implemented in Scala and allows to plot the evolution of an automata over time.
For more information on Wolfram's Cellular Automata check, e.g.: Rule 30 @ Mathworld and Rule 30 @ Wikipedia
The following images were generated by this program:
The project is built and run using SBT (Scala Build Tool)
-
Make sure that you have Scala and SBT installed
-
Checkout the repository to a local directory
-
Compile by calling
sbt compile
-
Test with
sbt test
-
Run with
sbt run
Several command line options are supported.