Rank | Mean | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Highest | |||||||||||||||||||||
2nd highest | |||||||||||||||||||||
3rd highest | |||||||||||||||||||||
4th highest | |||||||||||||||||||||
5th highest | |||||||||||||||||||||
6th highest | |||||||||||||||||||||
Mean |
(The preceding chart and table are for a single array.)
Mean | SD |
---|---|
I built this using Pyodide, Chart.js, and of course, my own Icepool Python library. A polynomial-time algorithm for keep-highest allows this calculator to deliver precise results at an interactive rate. It runs in your own browser, not requiring a server once loaded.
Compare previous AnyDice and Monte Carlo approaches.
If you want to play with Icepool more directly, try this example JupyterLite notebook, which computes the distributions of the total ability scores generated by the four Advanced Dungeons & Dragons 1st Edition methods.
Questions, comments, or suggestions? Find me on Reddit or Twitter.