关于「东西方原典考辨:陶侃投蒱博之具于江与卡尔达诺《论赌博游戏》」,《百家乐边际、算牌与破产》给出的定量结论是什么?

结论:第七章考辨《晋书·陶侃传》与卡尔达诺的《论赌博游戏》,按条件相等原则,公平的佣金只应是 0.026932。

数据口径:本书只做概率与破产分析,不鼓励任何赌博,不教任何博彩技巧,不推荐任何场所或平台;书中参数为示意,全部计算由书中程序生成;书中内容是非个人化理财建议。 第二章计算移牌效应、模拟整副牌靴并重做小牌堆实验:押庄为正期望的局只占 0.00286,完美信息观察者每一百局只得 0.0014 个单位。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.026932

throws n x 1/6 exact P(at least one six) gap
10.1667 0.1667 0.0000
20.3333 0.3056 0.0278
30.5000 0.4213 0.0787
40.6667 0.5177 0.1489
61.0000 0.6651 0.3349
three dice, at least one ace: exact 91/2160.4213
two dice, 24 throws, a double six: n x 1/360.6667, exact 0.4914
equal conditions on the eight-deck shoe:
fair Banker payout0.973068 (tables pay 0.95)
fair commission0.026932 (tables take 0.05)
fair Tie payout9.5091 to 1 (tables pay 8 to 1)
Player bet: fair only if P(Player) = P(Banker); gap 0.012351
查看完整验算程序
# Chapter 7. p71: Cardano's two ideas, tested. (1) The "reasoning on the
# mean" that Ore (1953) found in the Liber de Ludo Aleae: taking n times
# the one-throw chance as the chance of at least one success in n
# throws. Compare with the exact 1 - (5/6)^n, and the same slip in the
# later two-dice question of 24 throws. (2) His fundamental
# principle of equal conditions: a wager is fair when stakes match the
# chances. Applied to the exact eight-deck values of p11, it gives the
# fair Banker payout, the fair commission and the fair Tie payout, to
# set beside the 0.95 and 8 to 1 the tables pay.
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__":
    print("throws  n x 1/6   exact P(at least one six)   gap")
    for n in (1, 2, 3, 4, 6):
        naive = F(n, 6)
        exact = 1 - F(5, 6) ** n
        print("%6d   %.4f    %.4f                     %.4f" % (
            n, naive, exact, naive - exact))
    print("three dice, at least one ace: exact %s = %.4f" % (
        1 - F(5, 6) ** 3, 1 - F(5, 6) ** 3))
    dd = 1 - F(35, 36) ** 24
    print("two dice, 24 throws, a double six: n x 1/36 = %.4f, "
          "exact %.4f" % (F(24, 36), dd))
    wb, wp, wt = tally([128] + [32] * 9)
    fair_b = F(wp, wb)
    fair_t = F(wb + wp, wt)
    print("equal conditions on the eight-deck shoe:")
    print("  fair Banker payout  %.6f  (tables pay 0.95)" % fair_b)
    print("  fair commission     %.6f  (tables take 0.05)" % (1 - fair_b))
    print("  fair Tie payout     %.4f to 1 (tables pay 8 to 1)" % fair_t)
    print("  Player bet: fair only if P(Player) = P(Banker); gap %.6f" % (
        F(wb - wp, wb + wp + wt)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《百家乐庄闲边际精确枚举、算牌无效性与赌徒破产概率母典》第 7 章「东西方原典考辨:陶侃投蒱博之具于江与卡尔达诺《论赌博游戏》」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论