3 ms·
When I wrote Beautiful Abelian Sandpiles (https://eavan.blog/posts/beautiful-sandpiles.html https://eavan.blog/posts/beautiful-sandpiles.html) I wanted to show
by eavan0 7mo ago
When I wrote Beautiful Abelian Sandpiles (https://eavan.blog/posts/beautiful-sandpiles.html 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.
- eavan0 7mo agoThe precursor to this blog entry, was discussed here: https://news.ycombinator.com/item?id=46210044 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.
- pavel_lishin 7mo agoA few of your links point to the previous Abelian sandpile blog post, but use the `.md` extension instead of `.html`.
- eavan0 7mo agoGood catch, I've just fixed it now. Thanks