Sunday August 14, 2011
Modelling a game of chance can provide an interesting computational problem.
Player 1 has five four-sided (pyramidal) dice, each with faces numbered 1, 2, 3, 4.
Player 2 has four six-sided (cubic) dice, each with faces numbered 1, 2, 3, 4, 5, 6.
Players 1 and 2 roll their dice and compare totals: the highest total wins. The result is a draw if the totals are equal.
What is the probability that Player 1 beats Player 2? Give your answer to as many decimal places as possible.
(This problem is based on one from Project Euler).
Player 2 has four six-sided (cubic) dice, each with faces numbered 1, 2, 3, 4, 5, 6.
Players 1 and 2 roll their dice and compare totals: the highest total wins. The result is a draw if the totals are equal.
What is the probability that Player 1 beats Player 2? Give your answer to as many decimal places as possible.
(This problem is based on one from Project Euler).
Show solution
Challenge Resources:
©1994-2024
|
Shodor
|
Privacy Policy
|
NSDL
|
XSEDE
|
Blue Waters
|
ACM SIGHPC
|
|
|
|
|
|
XSEDE Code of Conduct
|
Not Logged In. Login
![Feedback feedback](http://hpcuniversity.org/media/images/feedback.png)
![Facebook facebook](http://hpcuniversity.org/media/images/face.png)
![Twitter twitter](http://hpcuniversity.org/media/images/twi.png)
![RSS rss](http://hpcuniversity.org/media/images/rss.png)
![YouTube youtube](http://hpcuniversity.org/media/images/youtub.png)