Calculating probability of intersecting sets (Dice rolls arranged in a grid)
$begingroup$
I've recently come across a stat rolling method used by some tabletop gamers that involves rolling 36 stat scores, placing them in a 6x6 grid, and selecting a row, column or diagonal of 6 values to use as your 6 scores.
I want to compare this system to the standard method of simply rolling 6 scores and using just those. With both methods each individual score is achieved by rolling 4 six-sided dice and adding the three highest values. I want to be able to compare these two methods with similar graphs/metrics to this anydice article.
I want to know 2 things:
- How do the bell curves/at-leasts for the SUM of all scores compare between the two methods
- How do the bell curves/at-leasts for the number of 18s you're likely to get compare between the two methods.
How do I calculate these probabilities?
I understand that for each roll, the probability of any specific result is the number of ways that result can be achieved divided by the number of possible results, so getting a 6 on a 6 sided dice is 1 in 6 (16.67%), getting an 18 on 3 6 sided dice (3d6) is 1 in 216 etc (0.4%), and the actual way of getting a single result, 4d6 drop lowest, can return a score of 18 by rolling 6 on any three dice, and anything on the other; so 21 in 1296 (1.62%).
What is getting me, though, is how I work out the number of possibilities and number of desired outcomes when 36 results are randomly entered into a 6x6 grid, and only certain sets (14) of 6 of these outcomes can be combined.
I'm not sure how to reliably test any hypothesis I may have, and even if I do formulate an idea and check it against some test tries I'd really want to get the actual principles of it.
probability dice
New contributor
$endgroup$
add a comment |
$begingroup$
I've recently come across a stat rolling method used by some tabletop gamers that involves rolling 36 stat scores, placing them in a 6x6 grid, and selecting a row, column or diagonal of 6 values to use as your 6 scores.
I want to compare this system to the standard method of simply rolling 6 scores and using just those. With both methods each individual score is achieved by rolling 4 six-sided dice and adding the three highest values. I want to be able to compare these two methods with similar graphs/metrics to this anydice article.
I want to know 2 things:
- How do the bell curves/at-leasts for the SUM of all scores compare between the two methods
- How do the bell curves/at-leasts for the number of 18s you're likely to get compare between the two methods.
How do I calculate these probabilities?
I understand that for each roll, the probability of any specific result is the number of ways that result can be achieved divided by the number of possible results, so getting a 6 on a 6 sided dice is 1 in 6 (16.67%), getting an 18 on 3 6 sided dice (3d6) is 1 in 216 etc (0.4%), and the actual way of getting a single result, 4d6 drop lowest, can return a score of 18 by rolling 6 on any three dice, and anything on the other; so 21 in 1296 (1.62%).
What is getting me, though, is how I work out the number of possibilities and number of desired outcomes when 36 results are randomly entered into a 6x6 grid, and only certain sets (14) of 6 of these outcomes can be combined.
I'm not sure how to reliably test any hypothesis I may have, and even if I do formulate an idea and check it against some test tries I'd really want to get the actual principles of it.
probability dice
New contributor
$endgroup$
1
$begingroup$
Seems like it would be easy enough to code up a simulation and run it a few million times.
$endgroup$
– amd
Jan 8 at 2:06
add a comment |
$begingroup$
I've recently come across a stat rolling method used by some tabletop gamers that involves rolling 36 stat scores, placing them in a 6x6 grid, and selecting a row, column or diagonal of 6 values to use as your 6 scores.
I want to compare this system to the standard method of simply rolling 6 scores and using just those. With both methods each individual score is achieved by rolling 4 six-sided dice and adding the three highest values. I want to be able to compare these two methods with similar graphs/metrics to this anydice article.
I want to know 2 things:
- How do the bell curves/at-leasts for the SUM of all scores compare between the two methods
- How do the bell curves/at-leasts for the number of 18s you're likely to get compare between the two methods.
How do I calculate these probabilities?
I understand that for each roll, the probability of any specific result is the number of ways that result can be achieved divided by the number of possible results, so getting a 6 on a 6 sided dice is 1 in 6 (16.67%), getting an 18 on 3 6 sided dice (3d6) is 1 in 216 etc (0.4%), and the actual way of getting a single result, 4d6 drop lowest, can return a score of 18 by rolling 6 on any three dice, and anything on the other; so 21 in 1296 (1.62%).
What is getting me, though, is how I work out the number of possibilities and number of desired outcomes when 36 results are randomly entered into a 6x6 grid, and only certain sets (14) of 6 of these outcomes can be combined.
I'm not sure how to reliably test any hypothesis I may have, and even if I do formulate an idea and check it against some test tries I'd really want to get the actual principles of it.
probability dice
New contributor
$endgroup$
I've recently come across a stat rolling method used by some tabletop gamers that involves rolling 36 stat scores, placing them in a 6x6 grid, and selecting a row, column or diagonal of 6 values to use as your 6 scores.
I want to compare this system to the standard method of simply rolling 6 scores and using just those. With both methods each individual score is achieved by rolling 4 six-sided dice and adding the three highest values. I want to be able to compare these two methods with similar graphs/metrics to this anydice article.
I want to know 2 things:
- How do the bell curves/at-leasts for the SUM of all scores compare between the two methods
- How do the bell curves/at-leasts for the number of 18s you're likely to get compare between the two methods.
How do I calculate these probabilities?
I understand that for each roll, the probability of any specific result is the number of ways that result can be achieved divided by the number of possible results, so getting a 6 on a 6 sided dice is 1 in 6 (16.67%), getting an 18 on 3 6 sided dice (3d6) is 1 in 216 etc (0.4%), and the actual way of getting a single result, 4d6 drop lowest, can return a score of 18 by rolling 6 on any three dice, and anything on the other; so 21 in 1296 (1.62%).
What is getting me, though, is how I work out the number of possibilities and number of desired outcomes when 36 results are randomly entered into a 6x6 grid, and only certain sets (14) of 6 of these outcomes can be combined.
I'm not sure how to reliably test any hypothesis I may have, and even if I do formulate an idea and check it against some test tries I'd really want to get the actual principles of it.
probability dice
probability dice
New contributor
New contributor
New contributor
asked Jan 7 at 2:12
Isaac ReefmanIsaac Reefman
1013
1013
New contributor
New contributor
1
$begingroup$
Seems like it would be easy enough to code up a simulation and run it a few million times.
$endgroup$
– amd
Jan 8 at 2:06
add a comment |
1
$begingroup$
Seems like it would be easy enough to code up a simulation and run it a few million times.
$endgroup$
– amd
Jan 8 at 2:06
1
1
$begingroup$
Seems like it would be easy enough to code up a simulation and run it a few million times.
$endgroup$
– amd
Jan 8 at 2:06
$begingroup$
Seems like it would be easy enough to code up a simulation and run it a few million times.
$endgroup$
– amd
Jan 8 at 2:06
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Isaac Reefman is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3064592%2fcalculating-probability-of-intersecting-sets-dice-rolls-arranged-in-a-grid%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Isaac Reefman is a new contributor. Be nice, and check out our Code of Conduct.
Isaac Reefman is a new contributor. Be nice, and check out our Code of Conduct.
Isaac Reefman is a new contributor. Be nice, and check out our Code of Conduct.
Isaac Reefman is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3064592%2fcalculating-probability-of-intersecting-sets-dice-rolls-arranged-in-a-grid%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
Seems like it would be easy enough to code up a simulation and run it a few million times.
$endgroup$
– amd
Jan 8 at 2:06