What does Baccarat Edges, Counting and Ruin conclude, in numbers, about “Staking Systems Cannot Change the Expectation: Doubling, d'Alembert and the Optional Stopping Theorem”?

Answer: Chapter 4 proves that doubling and other staking systems merely rearrange the same price: the expected loss per unit staked is always 0.013650.

Scope of the numbers: Its parameters are illustrative, all calculations are generated by its programs, and nothing in it is personalised financial advice. Marked boxes separate published evidence, runnable Python calculations (21 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.013650

decided-coup loss chance q = 0.506825, 2q - 1 = 0.013650
ktop stakeP(cycle busts)EV/cycleE[staked]EV/staked
340.130189-0.041513.0411-0.013650
5160.033442-0.070145.1384-0.013650
7640.008590-0.099557.2933-0.013650
92560.002207-0.129779.5074-0.013650
1110240.000567-0.1608211.7823-0.013650
k = 7: cycles until a bust is more likely than not: 80.3
k = 7: one bust costs 127 units = 127 winning cycles
Show the full program
# Chapter 4. p41: The doubling ("martingale") progression, exact. One
# cycle on the Player bet: stake 1, 2, 4 and so on after each decided
# loss (ties push and are skipped), stop at the first win (+1 unit) or
# after k straight losses, when a table limit or the bankroll forbids the
# next doubling (net -(2^k - 1)). With q the decided-coup loss chance:
# EV per cycle = 1 - (2q)^k, expected stake per cycle = ((2q)^k - 1) /
# (2q - 1), and their ratio is -(2q - 1) for every k: the progression
# only rearranges the same edge. Exact eight-deck values from p11.
import math
from fractions import Fraction as F


def banker_draws(b, p3):
    # 庄家补牌表:b 为庄两张牌点数,p3 为闲第三张牌点数
    if b <= 2:
        return True
    if b == 3:
        return p3 != 8
    if b == 4:
        return 2 <= p3 <= 7
    if b == 5:
        return 4 <= p3 <= 7
    if b == 6:
        return p3 in (6, 7)
    return False


DRAW = [[banker_draws(b, p3) for p3 in range(10)] for b in range(10)]
# WIN[p][b]:0 庄胜,1 闲胜,2 和
WIN = [[0 if b > p else 1 if p > b else 2 for b in range(10)]
       for p in range(10)]


def tally(c):
    # 返回 [庄胜, 闲胜, 和] 的整数权重,分母为 n 起连乘六项的降阶乘
    c = list(c)
    n = 0
    for x in c:
        n += x
    s4, s5 = (n - 4) * (n - 5), n - 5
    acc = [0, 0, 0]
    vals = range(10)
    for p1 in vals:
        w1 = c[p1]
        if not w1:
            continue
        c[p1] -= 1
        for b1 in vals:
            w2 = w1 * c[b1]
            if not w2:
                continue
            c[b1] -= 1
            for p2 in vals:
                w3 = w2 * c[p2]
                if not w3:
                    continue
                c[p2] -= 1
                pt = (p1 + p2) % 10
                for b2 in vals:
                    w4 = w3 * c[b2]
                    if not w4:
                        continue
                    c[b2] -= 1
                    bt = (b1 + b2) % 10
                    if pt >= 8 or bt >= 8 or (pt >= 6 and bt >= 6):
                        acc[WIN[pt][bt]] += w4 * s4
                    elif pt <= 5:
                        drw = DRAW[bt]
                        for p3 in vals:
                            w5 = w4 * c[p3]
                            if not w5:
                                continue
                            pf = (pt + p3) % 10
                            row = WIN[pf]
                            if drw[p3]:
                                c[p3] -= 1
                                for b3 in vals:
                                    acc[row[(bt + b3) % 10]] += w5 * c[b3]
                                c[p3] += 1
                            else:
                                acc[row[bt]] += w5 * s5
                    else:
                        row = WIN[pt]
                        w = w4 * s5
                        for b3 in vals:
                            acc[row[(bt + b3) % 10]] += w * c[b3]
                    c[b2] += 1
                c[p2] += 1
            c[b1] += 1
        c[p1] += 1
    return acc


if __name__ == "__main__":
    wb, wp, wt = tally([128] + [32] * 9)
    q = F(wb, wp + wb)
    print("decided-coup loss chance q = %.6f, 2q - 1 = %.6f" % (
        q, 2 * q - 1))
    print(" k  top stake  P(cycle busts)  EV/cycle  E[staked]  EV/staked")
    for k in (3, 5, 7, 9, 11):
        bust = q ** k
        evc = 1 - (2 * q) ** k
        staked = ((2 * q) ** k - 1) / (2 * q - 1)
        print("%2d  %9d  %.6f        %+.5f  %8.4f   %+.6f" % (
            k, 2 ** (k - 1), bust, evc, staked, evc / staked))
    k = 7
    bust = float(q ** k)
    half = math.log(0.5) / math.log(1 - bust)
    print("k = 7: cycles until a bust is more likely than not: %.1f" % half)
    print("k = 7: one bust costs %d units = %d winning cycles" % (
        2 ** k - 1, 2 ** k - 1))

Single source and citation

Fan, Y. (2026). Exact Enumeration of Baccarat House Edges, the Futility of Card Counting and Gambler's Ruin Probabilities (Version 1.0.0), Chapter 4: Staking Systems Cannot Change the Expectation: Doubling, d'Alembert and the Optional Stopping Theorem. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-224 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026224,
  author    = {Fan, Yafu},
  title     = {Exact Enumeration of Baccarat House Edges, the Futility of Card Counting and Gambler's Ruin Probabilities},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book