Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

Recursive Game of Life

oimo.io

Post reply on HN
Print view View original

41–50 of 123 posts

Re: Recursive Game of Life

#42

Post by kleene_op »

rodrigosetti wrote: post #3

This is awesome. How would one describe this formal system? There are no cells essentially

That's what's really awesome about it. In essence there's nothing but the rules of the game of life.

I wonder if it's the same for reality. Everytime we've been looking at some particles we deemed fundamental they appear to be made of even smaller ones.

Re: Recursive Game of Life

#43

Post by danbruc »

space_fountain wrote: post #39
nneonneo wrote: post #34

Earlier quoted context omitted.

Yes, you’re right on the state: the state for each level can just be OTCA timestep and x,y within the parent level. However, I think you need to store somewhat more than 2^4 animations: there are 35328 cycles per OTCA tick, and a cell’s animation depends on all of its neighbors, for something like 2^9 * 35328 distinct states. The vast majority of cells are quite predictable (and have short animation periods) but some…

Interesting, I guess I forgot that the game of life includes edge neighbors and had no idea of the cycle time. Why isn’t it 2^8 neighbors though?. Maybe just running 2^8 simulations is the way to go? Or that’s 9 megabytes * frame size per so maybe that ends up being small enough with compression Edit: the author has said that it’s non periodic apparently which seems like it would make this whole thing a lot harder an…

Eight neighbors plus the cell itself. With a period of 35,328 and a size of 2048 x 2048 cells for the OTCA metapixel you end up with ‭75,866,302,316,544‬ bit without any compression.

Re: Recursive Game of Life

#45

Post by danwills »

naikrovek wrote: post #11
Rendello wrote: post #2

Rarely do I look at a website in amazement and ask "How?". This is awesome.

there's an open source tool/toy called "Golly" which can show you. https://golly.sourceforge.net/

And if you want to explore continuous-state automata ('reaction diffusion') there's Golly's cousin-app Ready, too! (Next version of Ready's Houdini plugin (py3/H19.5) hopefully coming soon!)

Re: Recursive Game of Life

#46

Post by thunderrabbit »

brunorsini wrote: post #41
Cort3z wrote: post #36

I LOVE how you can set it to scroll forever by itself. This website is a true work of art.

I love that too, only wish auto-scrolling speed could be adjusted (would like it to be slower).

For me there's a horizontal slider in bottom middle of the screen which controls the auto-scrolling speed.

Re: Recursive Game of Life

#48

Post by Cthulhu_ »

space_fountain wrote: post #25
symmetricsaurus wrote: post #18

Very smooth. Wonder if there are any optimizations like Hashlife going on? There’s a lot of spatial redundancy to exploit. https://en.wikipedia.org/wiki/Hashlife

It need not do any simulation at all. Representing this as an animation should be very doable. Probably 2^4 animations (1 for each potential state of a cell) then you just need to tile the animations and replace sub pixels as needed. So you start out showing a zoomed in view of the animation. As you zoom out you tile based on the animation shown one layer up. The exact tiling is probably tough, but easier than actual…

I've also heard that Game of Life can be implemented as a pixel shader, so your browser gets to use all that dank GPU available.

But a looping animation makes sense too.

Re: Recursive Game of Life

#50

Post by svara »

Jerrrry wrote: post #9

At a certain draw distance (probably/hopefully depending on framerate and other specs), the platform replaces the individual cells with the OTCA metapixel, effectively giving the illusion that it is GoL all the way down. Neat, even when you know the trick. https://conwaylife.com/wiki/OTCA_metapixel

That's purely an optimization, though. Meaning, it would look just like this if it really was "GoL all the way down".
Post reply on HN