Add solutions for part 1
This commit is contained in:
20
projects/09/CellAutomaton1D/readme.md
Normal file
20
projects/09/CellAutomaton1D/readme.md
Normal file
@@ -0,0 +1,20 @@
|
||||
Cellular Automaton 1D
|
||||
---------------------
|
||||
|
||||
This project implements a one dimensional cellular automaton. It is like the
|
||||
famous *Game of Life*, but in 1D. If you are not familiar with the concept you
|
||||
can read more on
|
||||
[mathworld.wolfram.com](https://mathworld.wolfram.com/CellularAutomaton.html)
|
||||
so I recommend simply try the application. It should be self explanatory and
|
||||
you will be surprised.
|
||||
|
||||
The program runs in two stages. In the first stage the user configures the
|
||||
initial population of the one automaton as well as the rule that is used for
|
||||
creating the following populations. If you are not familiar with the rules
|
||||
*Rule 90* with an initial cell in the middle is good enough.
|
||||
|
||||
In the second stage the program computes and visualizes the automaton. The
|
||||
program can be paused with `p`, continued with `c`, single stepped with `s`,
|
||||
reset with `r`, and terminated with `q`.
|
||||
|
||||
Have fun!
|
||||
Reference in New Issue
Block a user