u/Danny_DeWario

2x2 Clusters Link: https://www.desmos.com/calculator/b8vwyvwlp7

3x3 Clusters Link: https://www.desmos.com/calculator/a51wcew4h3

original reddit post: Conway's Game of Life (boundless) : r/desmos

I've been playing around with a method of optimization for Conway's Game of Life. It works by grouping a cluster of cells into a single numerical value. For a group of 2x2, it groups 4 cells into a binary number (up to 15). For a group of 3x3, it groups 9 cells into a binary number (up to 511).

This binary numerical value can be broken down into its individual bits, and by using those bits we can determine which cells are alive/dead within that cluster.

I've considered making a graph which uses 4x4 clusters, but I'm honestly not sure if there would be any noticeable improvement in performance. Going from 2x2 to 3x3 wasn't as big of a jump in performance as was going from 1x1 to 2x2.

Link: https://www.desmos.com/calculator/mxpi9jz89m

Link: https://www.desmos.com/calculator/qmgmt2muhn

I tried making an efficient Conway's Game of Life without any bounds. Not sure if I can optimize any further, but I'm pretty satisfied with the results.

Link: https://www.desmos.com/calculator/il5b3wkv55

Rules:

Select the correct circle after randomized shuffling. The correct circle will always start at the top and be highlighted green at the beginning of every round.

Notes:

+You can choose from 2 to 20 circles, and a speed from 1 to 10.

+The game stores all total wins and total games played for each possible setting. At the end of each round, you will be shown your current win stats for that specific game's settings.

+You can manually enter your own settings outside the default ranges, but score keeping won't be possible for those settings.