Weekly Challenges
Solve the challenge, share your solution and summit the ranks of our Community!Also available in | Français | Português | Español | 日本語
IDEAS WANTED
Want to get involved? We're always looking for ideas and content for Weekly Challenges.
SUBMIT YOUR IDEA
Pretty decent solution, I think. Let's see how it stacks up
Saqueador
Process
- Append field for all three dice to generate all 216 combinations
- Calculate max, min, median, score for each combination
- Group by score, count instances of each score
- Sort by count (descending)
- Select most common
- Append field for all three dice to generate all 216 combinations
- Calculate max, min, median, score for each combination
- Group by score, count instances of each score
- Sort by count (descending)
- Select most common
Saqueador
I created individual rows/observations for each of the possible combinations of the three dice. Since these happen with equal probabilities, one can then go about calculating the score for each row. Using min and max functions to find the highest and lowest of the three dice was straightforward. I used a conditional statement to find the 2nd largest rolled number.
