7 comments

[ 0.21 ms ] story [ 25.6 ms ] thread
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.
A few of your links point to the previous Abelian sandpile blog post, but use the `.md` extension instead of `.html`.
I'm getting a PR_CONNECT_RESET_ERROR for this site - anybody else or is that just me?
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?
Cool. I didn't know the term before. It's basically like Conway's game of life with a different update rule.