Live data from Hacker News

The Biggest Identity Sandpiles and How to Compute Them

eavan.blog

1–10 of 13 posts

Re: The Biggest Identity Sandpiles and How to Compute Them

#2
When I wrote Beautiful Abelian Sandpiles (https://eavan.blog/posts/beautiful-sandpiles.html) I wanted to show off some nice images of large identity sandpiles. But the simple algorithm I used was horrendously slow. Showing a sandpile identity that was larger than 100 by 100 took multiple seconds! That's not good enough! I became obsessed with trying to find a faster way, all in an effort to compute bigger and bigger sandpile identities, bigger than anything anyone had seen before. In the end, I did exactly that.

Re: The Biggest Identity Sandpiles and How to Compute Them

#3
post #2

When I wrote Beautiful Abelian Sandpiles ( https://eavan.blog/posts/beautiful-sandpiles.html ) I wanted to show off some nice images of large identity sandpiles. But the simple algorithm I used was horrendously slow. Showing a sandpile identity that was larger than 100 by 100 took multiple seconds! That's not good enough! I became obsessed with trying to find a faster way, all in an effort to compute bigger and bigge…

The precursor to this blog entry, was discussed here: https://news.ycombinator.com/item?id=46210044 Shamefully, I somehow missed out on the discussion and can longer reply.

LegionMammal978 wanted to see a proper description of the identity calculation methods. You can consider this sequel to the initial blog post as an answer.

Re: The Biggest Identity Sandpiles and How to Compute Them

#6
post #2

When I wrote Beautiful Abelian Sandpiles ( https://eavan.blog/posts/beautiful-sandpiles.html ) I wanted to show off some nice images of large identity sandpiles. But the simple algorithm I used was horrendously slow. Showing a sandpile identity that was larger than 100 by 100 took multiple seconds! That's not good enough! I became obsessed with trying to find a faster way, all in an effort to compute bigger and bigge…

A few of your links point to the previous Abelian sandpile blog post, but use the `.md` extension instead of `.html`.

Re: The Biggest Identity Sandpiles and How to Compute Them

#7
post #2

When I wrote Beautiful Abelian Sandpiles ( https://eavan.blog/posts/beautiful-sandpiles.html ) I wanted to show off some nice images of large identity sandpiles. But the simple algorithm I used was horrendously slow. Showing a sandpile identity that was larger than 100 by 100 took multiple seconds! That's not good enough! I became obsessed with trying to find a faster way, all in an effort to compute bigger and bigge…

A few of your links point to the previous Abelian sandpile blog post, but use the `.md` extension instead of `.html`.

Good catch, I've just fixed it now. Thanks

Re: The Biggest Identity Sandpiles and How to Compute Them

#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.
Post reply on HN