Skip to main content
added 19 characters in body
Source Link
Cam McLeman
  • 8.5k
  • 3
  • 51
  • 65

The short answer is that youYou should use as many dice as possible while defending (so always 2, unless you have one army). This

This problem has no doubt been tackled by hundreds of probability students over the years, and it is not hard to Google and find a complete calculation. A likely best source for your buck for this, and related questions, will be Ivars Peterson's MathTrek article here:

http://www.maa.org/mathland/mathtrek_7_14_03.html

The short answer is that you should use as many dice as possible while defending. This problem has no doubt been tackled by hundreds of probability students over the years, and it is not hard to Google and find a complete calculation. A likely best source for your buck for this, and related questions, will be Ivars Peterson's MathTrek article here:

http://www.maa.org/mathland/mathtrek_7_14_03.html

You should use as many dice as possible while defending (so always 2, unless you have one army).

This problem has no doubt been tackled by hundreds of probability students over the years, and it is not hard to Google and find a complete calculation. A likely best source for your buck for this, and related questions, will be Ivars Peterson's MathTrek article here:

http://www.maa.org/mathland/mathtrek_7_14_03.html

Source Link
Cam McLeman
  • 8.5k
  • 3
  • 51
  • 65

The short answer is that you should use as many dice as possible while defending. This problem has no doubt been tackled by hundreds of probability students over the years, and it is not hard to Google and find a complete calculation. A likely best source for your buck for this, and related questions, will be Ivars Peterson's MathTrek article here:

http://www.maa.org/mathland/mathtrek_7_14_03.html