关于「注码法改不了期望:倍投、达朗贝尔与可选停止定理」,《百家乐边际、算牌与破产》给出的定量结论是什么?
结论:第四章证明倍投等注码法只重新排列同一个价格,每押一个单位的期望损失恒为 0.013650。
数据口径:本书只做概率与破产分析,不鼓励任何赌博,不教任何博彩技巧,不推荐任何场所或平台;书中参数为示意,全部计算由书中程序生成;书中内容是非个人化理财建议。 第二章计算移牌效应、模拟整副牌靴并重做小牌堆实验:押庄为正期望的局只占 0.00286,完美信息观察者每一百局只得 0.0014 个单位。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.013650
| decided-coup loss chance q = 0.506825, 2q - 1 = 0.013650 | |||||
| k | top stake | P(cycle busts) | EV/cycle | E[staked] | EV/staked |
| 3 | 4 | 0.130189 | -0.04151 | 3.0411 | -0.013650 |
| 5 | 16 | 0.033442 | -0.07014 | 5.1384 | -0.013650 |
| 7 | 64 | 0.008590 | -0.09955 | 7.2933 | -0.013650 |
| 9 | 256 | 0.002207 | -0.12977 | 9.5074 | -0.013650 |
| 11 | 1024 | 0.000567 | -0.16082 | 11.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 |
查看完整验算程序
# 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))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《百家乐庄闲边际精确枚举、算牌无效性与赌徒破产概率母典》第 4 章「注码法改不了期望:倍投、达朗贝尔与可选停止定理」(版本 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}
}