关于「读牌:筋是一条演绎,不是一条规律」,《四人不完全信息博弈》给出的定量结论是什么?
结论:第三章把筋牌推导成贝叶斯演绎:它使某张牌安全 3.6 倍,而非完全安全。
数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的模型和假说;除注明的文献数据外,书中数据都是合成的。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 3.6
Illustrative prior over wait shapes in one suit:
two-sided 23 waiting 1/4 wins on (1, 4) prior 0.34
two-sided 34 waiting 2/5 wins on (2, 5) prior 0.34
closed 13 waiting 2 wins on (2,) prior 0.11
pair 11 waiting 1 wins on (1,) prior 0.08
edge 12 waiting 3 wins on (3,) prior 0.07
three-sided 234 5 waiting 1/4/6 wins on (1, 4, 6) prior 0.06
A. No information: probability that each tile value deals in.
tile P(deal in)
1 0.480
2 0.450
3 0.070
4 0.400
5 0.340
6 0.060
B. The suji rule, derived. The opponent has discarded a 4, so no shape
that wins on 4 is possible (furiten). What happens to tile 1?
nothing discarded P(deal in | 1) = 0.480
4 discarded P(deal in | 1) = 0.133
Discarding 1 becomes 3.6 times safer, because the 23 two-sided shape
that wins on both 1 and 4 is ruled out. That is the whole content of the
suji heuristic: it is a furiten deduction, not a statistical regularity.
C. What suji does NOT rule out. With 4 discarded, tile 1 can still be won
on by:
pair 11 waiting 1 posterior 0.133
So suji lowers the risk without removing it, and the residual risk is
concentrated in the pair wait and the three-sided shape -- precisely the
shapes a player holding a strong hand is most likely to keep.查看完整验算程序
# Chapter 3. Bayesian hand reading. An opponent has declared a ready hand, and
# the only evidence is their discards. The classic heuristics -- a tile is
# safer if its "suji" partner has been discarded, and safer still if only one
# shape could use it -- are consequences of Bayes' rule once a prior over
# waits is written down, and the program derives the numbers rather than
# asserting them. Model (stated, not assumed silently): the opponent's wait is
# one of the tile types in a numbered suit; the prior over WAIT SHAPES is
# taken from the relative frequency with which each shape occurs in ready
# hands, and a shape is impossible if the opponent has discarded a tile that
# the shape would have won on (the furiten rule). All priors here are
# illustrative; the point is the structure of the update.
import math
SHAPES = {
# name: (list of winning tile values, prior weight)
"two-sided 23 waiting 1/4": ((1, 4), 0.34),
"two-sided 34 waiting 2/5": ((2, 5), 0.34),
"closed 13 waiting 2": ((2,), 0.11),
"edge 12 waiting 3": ((3,), 0.07),
"pair 11 waiting 1": ((1,), 0.08),
"three-sided 234 5 waiting 1/4/6": ((1, 4, 6), 0.06),
}
def normalise(d):
s = math.fsum(d.values())
return {k: v / s for k, v in d.items()}
def posterior(discards):
"""Shapes consistent with the furiten rule: an opponent cannot be waiting
on a
tile they have themselves discarded."""
post = {}
for name, (wins, w) in SHAPES.items():
if any(t in discards for t in wins):
continue # furiten: impossible
post[name] = w
return normalise(post) if post else {}
def p_deal_in(tile, discards, copies_left=None):
"""Probability that discarding `tile` completes the opponent's hand."""
post = posterior(discards)
return math.fsum(p for name, p in post.items() if tile in SHAPES[name][0])
if __name__ == "__main__":
print("Illustrative prior over wait shapes in one suit:")
for name, (wins, w) in sorted(SHAPES.items(), key=lambda kv: -kv[1][1]):
print(" {:34s} wins on {:12s} prior {:.2f}"
.format(name, str(wins), w))
print("\nA. No information: probability that each tile value deals in.")
print(" tile P(deal in)")
for t in range(1, 7):
print(" {:4d} {:12.3f}".format(t, p_deal_in(t, set())))
print(
"\nB. The suji rule, derived. The opponent has discarded a 4, so no"
" shape"
)
print("that wins on 4 is possible (furiten). What happens to tile 1?")
for label, disc in (("nothing discarded", set()), ("4 discarded", {4})):
print(" {:20s} P(deal in | 1) = {:.3f}"
.format(label, p_deal_in(1, disc)))
a, b = p_deal_in(1, set()), p_deal_in(1, {4})
print(
" Discarding 1 becomes {:.1f} times safer, because the 23 two-sided"
" shape".format(a / b if b else float("inf"))
)
print(
" that wins on both 1 and 4 is ruled out. That is the whole content"
" of the"
)
print(
" suji heuristic: it is a furiten deduction, not a statistical"
" regularity."
)
print(
"\nC. What suji does NOT rule out. With 4 discarded, tile 1 can still"
" be won"
)
print(" on by:")
for name, p in sorted(posterior({4}).items(), key=lambda kv: -kv[1]):
if 1 in SHAPES[name][0]:
print(" {:34s} posterior {:.3f}".format(name, p))
print(
" So suji lowers the risk without removing it, and the residual"
" risk is"
)
print(
" concentrated in the pair wait and the three-sided shape --"
" precisely the"
)
print(" shapes a player holding a strong hand is most likely to keep.")
print(
"\nD. Combining with the tile pool. Suji is about which shapes are"
" possible;"
)
print(
" the pool (Chapter 2) is about how many copies remain. Both"
" multiply:"
)
print(" tile suji? P(shape wins) copies left relative danger")
pool_note = []
for t, disc, copies in (
(1, set(), 3),
(1, {4}, 3),
(1, {4}, 1),
(3, set(), 2),
):
ps = p_deal_in(t, disc)
danger = ps * copies / 3.0
pool_note.append((t, "yes" if disc else "no", ps, copies, danger))
print(" {:4d} {:5s} {:15.3f} {:13d} {:17.3f}"
.format(t, "yes" if disc else "no", ps, copies, danger))
print(
"\n The last column is the product, scaled so that the first row"
" is the"
)
print(
" shape probability itself. A suji tile with three copies live can"
" be more"
)
print(
" dangerous than a non-suji tile with one copy live, so the two"
" heuristics"
)
print(
" cannot be applied in sequence as a checklist -- they have to be"
)
print(
" multiplied, which is what a model does and a rule of thumb does"
" not."
)
print(
"\nE. The model's limits, stated plainly. The prior above is"
" illustrative,"
)
print(
" not measured; real priors depend on the rule set, the scores, the"
" turn"
)
print(
" and the player. More importantly, the model treats the opponent's"
)
print(
" discards as INFORMATIVE BUT NOT STRATEGIC: a player who knows"
" they are"
)
print(
" being read can discard to mislead, and Chapter 6 shows that"
" against such"
)
print(
" an opponent no fixed reading rule is safe. The reading in this"
" chapter is"
)
print(
" therefore a best response to a NON-ADAPTIVE opponent, which"
" is the"
)
print(
" correct way to describe it and not the way it is usually"
" described."
)唯一数据源与引用
范雅福(Fan, Y.). (2026). 《四人不完全信息随机博弈、贝叶斯读牌与反事实遗憾最小化》第 3 章「读牌:筋是一条演绎,不是一条规律」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24020464
DOI: 10.5281/zenodo.24020464 · 阅读本章所在专著 · 5DL-B-055 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026055,
author = {Fan, Yafu},
title = {Imperfect-Information Stochastic Games, Bayesian Hand-Reading and Counterfactual Regret Minimisation in Four-Player Tile Dynamics},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24020464},
url = {https://doi.org/10.5281/zenodo.24020464}
}