r/gameoflife

fully stable btw

this is based off of my old still life i made, except none of these smaller disconnected parts are known

again i don't think this would be noticeable it's just something cool

The script & interpreter are both open source at github/phosxd/Ity

I just thought I'd share a fun little 2 hour terminal project

Ive written some code to find the highest pattern count possible. Finding patterns with up to 2 thousand is simple, takes a computer very little time. Even 5000+ iterations are not too hard to find, but there seems to be a gap between roughly 3k to 4k iters / generations

my repo if youre interested

Credits to Nicholas Carlini's original logic gates:

https://nicholas.carlini.com/writing/2021/improved-logic-gates-game-of-life.html

Over the past couple of days, I've been working on this project, where I (as the title indicates) created Conway's Game of Life in Desmos. This is a project that I've wanted to do for a really long time and I'm really happy that I was able to get it working.

On another note, there are a few questions that I've been trying to answer by tinkering with this simulation:

1. How long can the simulation be kept at bay before reaching a stable state?
2. How many different stable states can one find? (within the bounds of this 11x11 grid, of course)
3. Can we create a set of initial conditions resulting in an infinite loop?

If you can answer any of these or just create something cool with this sim, feel free to share it here, I'm really excited to see what can be made with this! I'm also very open to feedback on the project itself, especially with regard to the code, I'm 100% sure this current version isn't optimized.

In any case, I really hope you all enjoy this!

Link here

Credits to his article: https://nicholas.carlini.com/writing/2021/improved-logic-gates-game-of-life.html

I'll draw the AND and OR gates too using his rotation gate

The graph shows all state transitions for the Game of Life on a 4x4 toroidal grid (edge-wrapping).

With 16 cells, there are 2^{16} = 65,536 total states. By quotienting out spatial symmetries (translation, rotation, and reflection) the entire state space collapses into 805 canonical representatives.

• Red Central Node: The empty/extinction state (State 0), drawing in the vast majority of transient trees.
• 14 Blue Nodes: "Fixed states" in this quotient graph (self-loops). These include true still lifes as well as oscillators whose next phase is a rotated or translated version of the same canonical state. (Breakdown: 5 still lifes, 8 period-2, 1 period-4).
• Green Node Clusters: Two 4-state cycles. While they form a period-4 loop in this canonical graph, accounting for their rotational/translational shifts at each step gives them a true period of 8 on the actual grid.