Conway's game of life V8.7 V9 here ! https://scratch.mit.edu/projects/1143869507/ 100% pen 1 sprite z/w/scroll up=zoom in s/scroll down=zoom out arrow keys=move around space bar=run/stop Conway's Game of Life is a very simple cellular automaton: a theoretically infinite grid where each square is either on or off. -If a cell is off and three of its neighbors are on, then it will turn on at the next generation by reproduction. -If a cell is on, it will stay on only if it has 2 or 3 on neighbors. But you can change these values to experiment! What's fascinating about these rules in particular, and what prompted me to code this cellular automaton a third time, is that such simple rules give rise to such complicated and varied behavior that I wanted to be able to simulate a large number of cells. I also wanted to code an infinite grid, because having an infinite grid is the very essence of the game of life. To simulate large patterns, I recommend turbowarp, but scratch does the trick if you just want to experiment! https://turbowarp.org/1086026000?hqpen check out the credits for more details and a site that provides patterns. #gameoflife #life #GOL #cellular #automaton #cells #infinite #unbounded #bounded #pen #all #simulation
Music from Pixabay Thanks to @-Rex- for his incredible text engine: https://scratch.mit.edu/projects/406678232/ Thanks to @ArnoHu for some explanations and his RLE importer. check this out for interesting patterns: https://conwaylife.com/wiki/ Thanks to this video on hash tables: https://www.youtube.com/watch?v=AoC9wUstPtk&pp=ygUgYWxnbyBhdSB0YWJsZWF1IHRhYmxlIGRlIGhhY2hhZ2U%3D
