关于「向聴、进张与赛跑:忽略三家会高估胜率」,《四人不完全信息博弈》给出的定量结论是什么?

结论:第四章用动态规划算向聴,并指出单人「赛跑」模型把胜率高估 1.36 到 1.79 倍,误差随距离增大。

数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的模型和假说;除注明的文献数据外,书中数据都是合成的。

English version

对照数据表

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

One player's race, 18 own draws, unseen pool 70 tiles.
A. WITHOUT competing risk (the naive model: no other players exist):
   start shanten   P(win)   P(wall exhausts)
               1    0.973             0.027
               2    0.943             0.057
               3    0.886             0.114
               4    0.790             0.210
B. WITH competing risk. Three opponents, each ending the hand with
probability about 0.016 per turn, so a combined hazard near 0.047:
   start     P(win)   P(an opponent   P(wall      naive / real
   shanten            ends it)        exhausts)
         1      0.716        0.272         0.011          1.36
         2      0.627        0.350         0.024          1.51
         3      0.536        0.416         0.048          1.65
         4      0.441        0.470         0.088          1.79
   The naive model overstates the win probability by a factor of 1.36 at
   1-shanten rising to 1.79 at 4-shanten: the error GROWS with distance,
   because a hand far from ready spends more turns exposed to the hazard.
   That direction is the structural lesson, and it means any comparison of
   a fast cheap hand against a slow valuable one is biased toward the slow
   hand if competing risk is left out.
   A calibration warning, because the absolute numbers above are too high.
   In recorded play a player wins roughly a fifth of hands, and roughly
   half of the hands in which they declare a ready hand with a good wait.
   This model gives 0.72 at 1-shanten even with the hazard, for three
   reasons: it starts every hand already at 1-shanten, whereas most hands
   never get that close; it lets the player draw freely for all 18 turns;
   and its completion rate per turn is generous. So the model is COMPARATIVE
查看完整验算程序
# Chapter 4. The hand as a race, and why a one-player race model is badly
# wrong. State = shanten distance; each own draw advances with probability set
# by the acceptance count (p04) over the unseen pool (p02). Once ready, the
# player wins by drawing or claiming a winning tile. The program first
# computes this WITHOUT competing risk, then adds the hazard that one of the
# three opponents ends the hand first, and compares. The gap between the two
# is the point of the chapter: ignoring the other three players inflates the
# win probability several-fold, which is the commonest error in informal
# analysis of this game. Illustrative parameters; standard library only.
import math

TURNS = 18
POOL = 70

def p_adv(acc):
    return min(1.0, acc / float(POOL))

def p_hit(win_tiles):
    """Per-turn chance of completing: own draw plus roughly one claimable
    discard."""
    return min(1.0, 1.9 * win_tiles / float(POOL))

def simulate(shanten, acc, win_tiles, opp_hazard, turns=TURNS):
    """Exact forward recursion. Returns (P(win), P(someone else ends it),
    P(exhaustive draw)). opp_hazard = per-turn probability the hand ends
    through
    an opponent (their win, by draw or by someone dealing in)."""
    # state: (distance remaining); distance 0 means ready
    state = {shanten: 1.0}
    p_win = p_opp = 0.0
    for t in range(turns):
        nxt = {}
        for d, w in state.items():
            # the opponents may end the hand first, before this player's
            # action
            p_opp += w * opp_hazard
            w2 = w * (1.0 - opp_hazard)
            if d == 0:
                h = p_hit(win_tiles)
                p_win += w2 * h
                nxt[0] = nxt.get(0, 0.0) + w2 * (1 - h)
            else:
                a = p_adv(acc)
                nxt[d - 1] = nxt.get(d - 1, 0.0) + w2 * a
                nxt[d] = nxt.get(d, 0.0) + w2 * (1 - a)
        state = nxt
    return p_win, p_opp, math.fsum(state.values())

if __name__ == "__main__":
    print(
        "One player's race, {} own draws, unseen pool {} tiles.\n".format(
            TURNS, POOL
        )
    )
    ACC = 28

    print(
        "A. WITHOUT competing risk (the naive model: no other players exist):"
    )
    print("   start shanten   P(win)   P(wall exhausts)")
    naive = {}
    for s in (1, 2, 3, 4):
        pw, po, pe = simulate(s, ACC, 8, 0.0)
        naive[s] = pw
        print("   {:13d} {:8.3f} {:17.3f}".format(s, pw, pe))

    print(
        "\nB. WITH competing risk. Three opponents, each ending the hand with"
    )
    print(
        "probability about 0.016 per turn, so a combined hazard near 0.047:"
    )
    print("   start     P(win)   P(an opponent   P(wall      naive / real")
    print("   shanten            ends it)        exhausts)")
    for s in (1, 2, 3, 4):
        pw, po, pe = simulate(s, ACC, 8, 0.047)
        print("   {:7d} {:10.3f} {:12.3f} {:13.3f} {:13.2f}"
              .format(s, pw, po, pe, naive[s] / pw if pw else float("nan")))

    f1 = naive[1] / simulate(1, ACC, 8, 0.047)[0]
    f4 = naive[4] / simulate(4, ACC, 8, 0.047)[0]
    print(
        "\n   The naive model overstates the win probability by a factor of"
        " {:.2f} at".format(f1)
    )
    print(
        "   1-shanten rising to {:.2f} at 4-shanten: the error GROWS with"
        " distance,".format(f4)
    )
    print(
        "   because a hand far from ready spends more turns exposed to the"
        " hazard."
    )
    print(
        "   That direction is the structural lesson, and it means any"
        " comparison of"
    )
    print(
        "   a fast cheap hand against a slow valuable one is biased toward"
        " the slow"
    )
    print("   hand if competing risk is left out.")

    print(
        "\n   A calibration warning, because the absolute numbers above are"
        " too high."
    )
    print(
        "   In recorded play a player wins roughly a fifth of hands, and"
        " roughly"
    )
    print(
        "   half of the hands in which they declare a ready hand with a good"
        " wait."
    )
    print(
        "   This model gives {:.2f} at 1-shanten even with the hazard, for"
        " three".format(simulate(1, ACC, 8, 0.047)[0])
    )
    print(
        "   reasons: it starts every hand already at 1-shanten, whereas most"
        " hands"
    )
    print(
        "   never get that close; it lets the player draw freely for all {}"
        " turns;".format(TURNS)
    )
    print(
        "   and its completion rate per turn is generous. So the model is"
        " COMPARATIVE"
    )
    print("   only - it ranks options against each other - and its absolute")
    print(
        "   probabilities should not be quoted. Section C shows how sensitive"
        " even"
    )
    print(
        "   the comparison is to the one parameter that is hardest to pin"
        " down."
    )

    print("\nC. Sensitivity to the opponents' hazard, 1-shanten start:")
    print("   combined hazard per turn   P(win)   P(opponent ends it)")
    for hz in (0.00, 0.02, 0.047, 0.07, 0.10):
        pw, po, pe = simulate(1, ACC, 8, hz)
        print("   {:24.3f} {:8.3f} {:20.3f}".format(hz, pw, po))

    print(
        "\nD. The decision that actually arises: at 1-shanten, keep a wide"
        " cheap"
    )
    print(
        "shape or switch to a narrow valuable one? Hazard 0.047 throughout."
    )
    print("   option                acceptance  win tiles  P(win)  value"
          "  E[points]")
    rows = []
    for label, acc1, wint, value in (("wide and cheap", 28, 8, 2000),
                                     ("wide and medium", 24, 8, 3900),
                                     ("narrow and valuable", 12, 4, 8000),
                                     ("narrow and huge", 8, 2, 12000)):
        pw, po, pe = simulate(1, acc1, wint, 0.047)
        rows.append((label, pw, value, pw * value))
        print("   {:21s} {:10d} {:10d} {:7.3f} {:6d} {:10.0f}"
              .format(label, acc1, wint, pw, value, pw * value))

    best = max(rows, key=lambda r: r[3])
    widest = rows[0]
    print("\n   The highest expected points is '{}' at {:.0f},"
          .format(best[0], best[3]))
    print("   while the highest win probability is '{}' at {:.3f}."
          .format(widest[0], widest[1]))
    print("   The two rankings disagree, which is")
    print(
        "   why a probability model is not yet a strategy: the quantity to"
        " maximise"
    )
    print("   is points.")

    print(
        "\nE. And the term still missing: the cost of dealing in while"
        " pushing."
    )
    print(
        "   E[points] = P(win) x value - q x 5200, for the deal-in"
        " probability q:"
    )
    print("   option                       q = 0      q = 0.08   q = 0.15")
    for label, pw, value, ev in rows:
        print("   {:28s} {:9.0f} {:11.0f} {:10.0f}"
              .format(label, ev, ev - 0.08 * 5200, ev - 0.15 * 5200))
    neg = [r[0] for r in rows if r[3] - 0.15 * 5200 < 0]
    print("\n   At q = 0.15, {} of the four options are negative: {}."
          .format(len(neg), ", ".join(neg) if neg else "none"))
    print(
        "   Chapter 5 treats when to stop pushing as an optimal stopping"
        " problem,"
    )
    print(
        "   and these numbers are why it cannot be settled by win probability"
        " alone."
    )

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《四人不完全信息随机博弈、贝叶斯读牌与反事实遗憾最小化》第 4 章「向聴、进张与赛跑:忽略三家会高估胜率」(版本 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}
}

本书其他章节结论