Odds algorithm: Difference between revisions

Content deleted Content added
Multiple choice problem: clearer language
Multiple choice problem: and an algorithm
Line 84:
For general positive integer <math>r</math>, {{harvnb|Matsui|Ano|2016}} discussed the tight lower bound of win probability.
When <math> r=3,4,5 </math>, tight lower bounds of win probabilities are equal to <math> e^{-1}+ e^{-\frac{3}{2}}+e^{-\frac{47}{24}} </math>, <math> e^{-1}+e^{-\frac{3}{2}}+e^{-\frac{47}{24}}+e^{-\frac{2761}{1152}} </math> and <math> e^{-1}+e^{-\frac{3}{2}}+e^{-\frac{47}{24}}+e^{-\frac{2761}{1152}}+e^{-\frac{4162637}{1474560}}, </math> respectively.
 
For further numerical cases thatfor <math>r=6,...,10</math>, and an algorithm for general cases, see {{harvnb|Matsui|Ano|2016}}.
 
== See also ==