What does Baccarat Edges, Counting and Ruin conclude, in numbers, about “Exact Enumeration of the Eight-Deck Shoe: Where Banker 1.06 % and Player 1.24 % Come From”?

Answer: Chapter 1 enumerates every card sequence of an eight-deck shoe in rational arithmetic: Banker wins 0.458597, Player 0.446247 and a tie 0.095156, with house edges of 0.010579 on Banker and 0.012351 on Player, agreeing digit for digit with the values Thorp and Walden published in 1966.

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.012351, 0.095156, 0.446247, 0.458597

eight decks, 416 cards; exact fractions in lowest terms
common denominator has 14 digits
P(Banker)0.458597
P(Player)0.446247
P(Tie)0.095156
check: sum of the three fractions =1 -> True
EV Banker bet (pays 0.95)-0.010579
EV Player bet (pays 1)-0.012351
EV Tie bet (pays 8)-0.143596
house edge Banker0.0106 Player = 0.0124
commission cost 0.05 x P(Banker)0.022930
Banker beats Player by0.012351
edge per decided bet: B 0.0117 P 0.0136
Show the full program
# Chapter 1. p11: Exact Banker / Player / Tie probabilities for eight decks.
# Model: every ordered sequence of the four, five or six cards a coup can
# use is weighted by its exact count without replacement (point values
# 0 to 9; tens and faces count 0). Cards are grouped by point value, so
# the loops run over 10 values instead of 416 cards. Rules: the standard
# third-card table (Player draws on 0-5; Banker by its own total and the
# Player's third card). Payoffs: Player 1 to 1, Banker 0.95 to 1, Tie 8
# to 1, ties push the two main bets. All counts are integers; the final
# ratios are exact fractions. Source of the rules: Thorp and Walden 1966.
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


def edges(c):
    wb, wp, wt = tally(c)
    d = wb + wp + wt
    pb, pp, pt = F(wb, d), F(wp, d), F(wt, d)
    banker = F(19, 20) * pb - pp
    player = pp - pb
    tie = 8 * pt - (1 - pt)
    return pb, pp, pt, banker, player, tie


if __name__ == "__main__":
    shoe = [128] + [32] * 9
    pb, pp, pt, eb, ep, et = edges(shoe)
    d = pb.denominator
    print("eight decks, 416 cards; exact fractions in lowest terms")
    print("common denominator has", len(str(d)), "digits")
    print("P(Banker) = %.6f" % pb)
    print("P(Player) = %.6f" % pp)
    print("P(Tie)    = %.6f" % pt)
    print("check: sum of the three fractions == 1 ->", pb + pp + pt == 1)
    print("EV Banker bet (pays 0.95) = %.6f" % eb)
    print("EV Player bet (pays 1)    = %.6f" % ep)
    print("EV Tie bet (pays 8)       = %.6f" % et)
    print("house edge Banker = %.4f   Player = %.4f" % (-eb, -ep))
    print("commission cost 0.05 x P(Banker) = %.6f" % (pb / 20))
    print("Banker beats Player by           = %.6f" % (pb - pp))
    print("edge per decided bet: B %.4f  P %.4f" % (
        -eb / (1 - pt), -ep / (1 - pt)))

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 1: Exact Enumeration of the Eight-Deck Shoe: Where Banker 1.06 % and Player 1.24 % Come From. 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