I’ve been thinking about scripting a version of John Conway’s Game of Life, after seeing @mloggers recent Instagram post where he uses an implementation on Norns to great, melodic effect.
As I am a few hours away from being able to sit at the TT, I thought it might be productive to post here and see if anyone can suggest an approach.
My first thought was to store the current and next state of the Grid’s 128 cells in the 4 available patterns (using 2 patterns per state), but the BIT op would be more efficient. (eg 8 cells could be stored in one pattern entry in binary and read off using BIT?)
Then I wondered if it was possible to use Pages (Groups?) and check the state of a cell in a group other than the active group - to avoid having to store the cell states anywhere else. I’m not very familiar with Pages.
Obviously a dedicated Op would be the fastest, least script-heavy solution - and maybe the TT devs have thoughts on this.
It would probably be more useful if the ruleset could be set as part of the Op. Or is this too niche? I think @mlogger has shown that it could be put to very musical use!
Edit: Just to add that, Game of Life Cellular Automata can’t be achieved with CHAOS.ALG 3.