Live data from Hacker News

The Biggest Identity Sandpiles and How to Compute Them

eavan.blog

11–13 of 13 posts

Re: The Biggest Identity Sandpiles and How to Compute Them

#11
post #8

This is so cool. Reminds of the 2-player game named "Chain Reaction".

I didn't know about this game, looks fun. I'm trying to think if knowledge of sandpile identities could help strategically in the game, somehow. But I can't see anything obvious.

Re: The Biggest Identity Sandpiles and How to Compute Them

#12
post #10
post #9

Cool. I didn't know the term before. It's basically like Conway's game of life with a different update rule.

Yes, the stabilisation process is like a cellular automaton. However, in this case there are no infinite "games", all configurations eventually stabilise. But that doesn't make it less interesting. You can define similar setups on different grids, e.g. hexagonal, and get similar update rules and patterns.

Cool stuff, thanks

Re: The Biggest Identity Sandpiles and How to Compute Them

#13
post #11
post #8

This is so cool. Reminds of the 2-player game named "Chain Reaction".

I didn't know about this game, looks fun. I'm trying to think if knowledge of sandpile identities could help strategically in the game, somehow. But I can't see anything obvious.

The idea of [Abelian Sandpiles] seems very intriguing. Can you recommend some sources to read more about its theory?
Post reply on HN