CS guys, is there a way to calculate (exactly) the probability distribution that scales better than n^2 (n is number of dice)? I don't think so, but I do know there are extremely clever algorithm engineers out there.
It's worth pointing out that by the time you get to the number of dice where you have to worry about computer performance, you can easily analytically calculate the normal distribution to get the probability distribution within only very tiny errors. The Central Limit Theorem is nice like that!
Log in to comment