Here are all 256 "rules"! Choose the rule and then pick whether to run from a random seed or basic seed (only 1 pixel) - this will result in different behavior. The point of this project is to make complex and beautiful patterns using very simple mathematics - you don't need to understand the formulas, just enjoy studying the shapes :D Conway's Game of Life: https://scratch.mit.edu/projects/45779124/ Find more: http://scratch.mit.edu/studios/886132/ Read more: http://mathworld.wolfram.com/ElementaryCellularAutomaton.html
Awesome rules: 22, 30, 45, 60, 73, 101, 124, 129, 150, 165, 169, 182. If you liked Rule 73, here is a more complex analysis: https://scratch.mit.edu/projects/44876742/ These cellular automatons take a "seed" - a base state consisting of 1s and 0s that you see as black and white pixels. Then, the next generation is calculated by applying the "rule" to the previous generation. By using these rules, we can get beautiful patterns. The rules are named after numbers from 0 to 255 because the "rules" are derived from a byte - 8 1s or 0s attached together. When I say "the rule is applied", I mean the program reads through the 1s and 0s of the last line, bit by bit. It looks at the three bits directly above x - at (x - 1, n - 1), (x, n - 1) and (x + 1, n - 1) where n=the generation. By reading 3 bits, we attach them together and interpret them as an integer written in binary - this gives us a number 0 - 7. Here is where the rule happens: Suppose we got a number B which is in 0 - 7. This is exactly 8 possible choices! So we look at the Bth bit of our rule-byte, and that becomes the new pixel at x. We do this for all the pixels in the row, then move on to the next generation.
