What does Baccarat Edges, Counting and Ruin conclude, in numbers, about “The Price of a Session: Loss Distributions, a Hard Stop Line and Chasing”?
Answer: Chapter 6 shows that a hard stop line makes the chance of losing more than the budget zero, while one buy-back raises it to 0.1484 within 300 coups.
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.1484, 300
| Banker, 1 unit a coup, original budget 20 units | |||||
| cap | rule | P(lose > 20) | E[net] | E[coups] | worst |
| 90 | hard stop | 0.0000 | -0.945 | 89.3 | 20.00 |
| 90 | chase once | 0.0148 | -0.952 | 90.0 | 40.00 |
| 90 | chase twice | 0.0148 | -0.952 | 90.0 | 60.00 |
| 90 | no stop line | 0.0148 | -0.952 | 90.0 | 90.00 |
| 300 | hard stop | 0.0000 | -2.804 | 265.0 | 20.00 |
| 300 | chase once | 0.1484 | -3.160 | 298.7 | 40.00 |
| 300 | chase twice | 0.1482 | -3.174 | 300.0 | 60.00 |
| 300 | no stop line | 0.1482 | -3.174 | 300.0 | 300.00 |
Show the full program
# Chapter 6. p63: Why the stop line must be hard. "Chasing" means buying
# back in after the budget is gone. Buying back in once or twice under
# the same coup limit is the same chain as a budget two or three times
# larger, so the plan() model of p62 answers it exactly. Reported: the
# chance of losing more than 20 units (the original budget), the expected
# net and the worst case, for a hard stop and for chasing, at coup
# limits of 90 and 300. Units and limits are illustrative.
import math
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 plan(budget, cap, win_stop, side, pb, pp, pt, mark=None):
# 预算 budget 单位、每局 1 单位、最多 cap 局、赢够 win_stop 收手
# (0 表示不设)。以二十分之一单位为格点,逐局推进分布。
# mark:另报「净输超过 mark 单位」的概率。
up = 19 if side == "B" else 20
pw, pl = (pb, pp) if side == "B" else (pp, pb)
start = 20 * budget
top = start + 20 * win_stop if win_stop else None
live = {start: 1.0}
final = {}
hit_stop, hit_win, played = [], [], []
for k in range(cap):
played.append(math.fsum(live.values()))
new = {}
for x in sorted(live):
m = live[x]
for y, pr in ((x + up, pw), (x - 20, pl), (x, pt)):
new[y] = math.fsum((new.get(y, 0.0), m * pr))
live = {}
for y in sorted(new):
if y < 20:
hit_stop.append(new[y])
final[y] = math.fsum((final.get(y, 0.0), new[y]))
elif top is not None and y >= top:
hit_win.append(new[y])
final[y] = math.fsum((final.get(y, 0.0), new[y]))
else:
live[y] = new[y]
for y in sorted(live):
final[y] = math.fsum((final.get(y, 0.0), live[y]))
nets = sorted((y - start) / 20 for y in final)
mean = math.fsum(final[y] * (y - start) / 20 for y in sorted(final))
cum, q90 = [], 0.0
for y in sorted(final):
cum.append(final[y])
if math.fsum(cum) >= 0.1:
q90 = (y - start) / 20
break
mk = budget if mark is None else mark
over = [final[y] for y in sorted(final) if (start - y) > 20 * mk]
return {"p_mark": math.fsum(over), "p_stop": math.fsum(hit_stop),
"p_win": math.fsum(hit_win), "p_cap": math.fsum(live.values()),
"mean": mean, "coups": math.fsum(played), "loss90": -q90,
"worst": -nets[0]}
if __name__ == "__main__":
wb, wp, wt = tally([128] + [32] * 9)
d = wb + wp + wt
pb, pp, pt = wb / d, wp / d, wt / d
print("Banker, 1 unit a coup, original budget 20 units")
print("cap rule P(lose > 20) E[net] E[coups] worst")
for cap in (90, 300):
for name, bud in (("hard stop", 20), ("chase once", 40),
("chase twice", 60), ("no stop line", 400)):
r = plan(bud, cap, 0, "B", pb, pp, pt, mark=20)
print("%3d %-12s %.4f %+7.3f %6.1f %6.2f" % (
cap, name, r["p_mark"], r["mean"], r["coups"], r["worst"]))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 6: The Price of a Session: Loss Distributions, a Hard Stop Line and Chasing. 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
- Chapter 1 · Exact Enumeration of the Eight-Deck Shoe: Where Banker 1.06 % and Player 1.24 % Come From
- Chapter 2 · Why Counting Barely Works: Effects of Removal, Simulated Shoes and the Fundamental Theorem
- Chapter 3 · Gambler's Ruin: a Finite Bankroll Against a House Without a Ceiling
- Chapter 4 · Staking Systems Cannot Change the Expectation: Doubling, d'Alembert and the Optional Stopping Theorem
- Chapter 5 · The Road Has No Predictive Power: Streak Lengths, Runs Tests and Small-Sample Bias
- Chapter 7 · Sources East and West: Tao Kan Throws the Gaming Pieces into the River, and Cardano's Book on Games of Chance
- Chapter 8 · Closing the Loop: the Entertainment Stop-Loss Calculator, Risk Notices and Pre-Registered Tests