Conway's game of life V9.9 [featuring Hashlife]

Instructions

Conway's game of life V9.9 Currently the fastest implementation on scratch as far as I can tell. To simulate large patterns, I recommend using TurboWarp. https://turbowarp.org/1143869507 scroll with the mouse in the catalog 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 fourth 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. check out the credits for more details and a site that provides patterns. I really recommend this remix which features a garbage collector: https://scratch.mit.edu/projects/1218751411 tags: #hashlife #gameoflife #life #GOL #Cgol #cellular #automaton