Odds algorithm: Difference between revisions

Revision as of 17:30, 23 February 2009

Revision as of 17:31, 23 February 2009

Line 60:

The Odds-theorem states that

i) # The odds-strategy is '''optimal''', that is, it maximizes the probability of stopping on the last 1.

# The win probability of the odds-strategy equals <math>\,w= Q_s R_s </math>

# If <math>\, ii)R_s \ge \,1 The</math>, the win probability of<math>\, thew</math> odds-strategyis equalsalways at least <math> \,w1/e = Q_s R_s 0.378\dots</math>, and this lower bound is '''best possible.'''

iii) If <math>\, R_s \ge \,1 </math>, the win probability <math>\, w</math> is always at least <math> \,1/e = 0.378\dots</math>, and this lower bound is '''best possible.'''

==Features of the odds-algorithm==