This gist contains code that can be loaded into tixy.land through my merge-request at aemkei/tixy.
It can be seen in action at contrib.pother.ca/tixy?gist=c37b144721a707d6115647ad0889fea3
The code from the MR is also available as an external service: https://gist-to-tixy.potherca.workers.dev/?gist=c37b144721a707d6115647ad0889fea3
| // (t,i,x,y) => | |
| t // for every frame … | |
| ? i // for every cell … | |
| ? [ | |
| s = // neighbour counter (off-by-one) | |
| 1, 15, 16, 17 // positive neighbour offset | |
| ].map( | |
| N => | |
| s += // count neighbours | |
| O[i + N] + // positive offset | |
| O[i - N] // negative offset | |
| ) | |
| : N = [O = N] // swap old (O) and new (N) state | |
| : i // first run | |
| ? N[i] = i < 82 // initial seed for cells | |
| : N = [], // create array to keep state | |
| N[i] = // set new state for cell | |
| 4 == s | // if is has three neighbours | |
| O[i] & // or cell lives | |
| 3 == s // … and has two neighbours |