关于「牌池:超几何推断与一个方向相反的结果」,《四人不完全信息博弈》给出的定量结论是什么?

结论:第二章把牌池写成超几何推断:两面听相对单骑的优势只在后期接近 2(剩 2 次摸牌时 1.94),前期只有 1.38。

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

English version

对照数据表

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

Set of 136 tiles; 14 set aside in the dead wall.
A player's own draws remaining are counted from the turn number.
Mid-game: own hand 13, visible tiles 36, so the unseen pool this player
draws from (wall plus three concealed hands) is 73 tiles.
A. Probability of drawing at least one acceptance tile, by how many copies
remain and how many draws are left:
   copies left   4 draws   8 draws   12 draws   16 draws
             1     0.055     0.110     0.164     0.219
             2     0.107     0.209     0.304     0.393
             3     0.158     0.298     0.421     0.530
             4     0.206     0.378     0.521     0.637
             6     0.296     0.515     0.674     0.787
             8     0.378     0.625     0.781     0.877
B. What one visible copy is worth. A wait on a tile type with 4 copies
live, as copies appear in discards, with 10 draws remaining:
   0 copies visible -> 4 live: P = 0.453  (+0.0% relative to none visible)
   1 copies visible -> 3 live: P = 0.362  (-20.1% relative to none visible)
   2 copies visible -> 2 live: P = 0.257  (-43.3% relative to none visible)
   3 copies visible -> 1 live: P = 0.137  (-69.7% relative to none visible)
   The first visible copy costs about a sixth of the chance; the third
   costs more than half. This is the formal content of the ordinary advice
   to abandon a wait whose tiles are mostly gone, and the size of the
   effect is set by the pool, not by intuition.
C. A two-sided wait against a one-sided wait, same number of draws (10):
   two-sided (8 live)     P = 0.712
   one-sided (4 live)     P = 0.453
   pair wait (2 live)     P = 0.257
   The two-sided wait is 1.57 times the one-sided wait in probability of
查看完整验算程序
# Chapter 2. The tile pool as a hypergeometric inference problem. A player
# sees their own hand, every discard, and every exposed meld. Everything else
# -- the wall and the three concealed hands -- is one undifferentiated pool
# from that player's point of view, and the question "how many of tile t are
# left" has an exact answer, while "will I draw one" is hypergeometric. The
# program computes the probability of drawing at least one of a set of useful
# tiles in the remaining draws, and shows how much the answer moves when a
# single copy becomes visible. Exact arithmetic; standard library only.
import math

TYPES, COPIES = 34, 4
TOTAL = TYPES * COPIES          # 136
DEAD_WALL = 14                  # set aside, never drawn in the standard rule

def own_draws_left(turn, players=4):
    """Draws this player still takes, if the live wall is exhausted at turn
    18."""
    return max(0, 18 - turn)

def p_at_least_one(useful_left, pool, draws):
    """Hypergeometric: P(at least one useful tile among `draws` from
    `pool`)."""
    if draws <= 0 or useful_left <= 0:
        return 0.0
    if useful_left >= pool:
        return 1.0
    # P(none) = C(pool - useful, draws) / C(pool, draws)
    return 1.0 - math.comb(pool - useful_left, draws) / math.comb(pool, draws)

if __name__ == "__main__":
    print(
        "Set of {} tiles; {} set aside in the dead wall.".format(
            TOTAL, DEAD_WALL
        )
    )
    print(
        "A player's own draws remaining are counted from the turn number.\n"
    )

    # a typical mid-game position: own 13 tiles, 36 tiles visible as
    # discards/melds
    own, visible = 13, 36
    pool = TOTAL - DEAD_WALL - own - visible
    print(
        "Mid-game: own hand {}, visible tiles {}, so the unseen pool this"
        " player".format(own, visible)
    )
    print(
        "draws from (wall plus three concealed hands) is {} tiles.\n".format(
            pool
        )
    )

    print(
        "A. Probability of drawing at least one acceptance tile, by how many"
        " copies"
    )
    print("remain and how many draws are left:")
    print("   copies left   4 draws   8 draws   12 draws   16 draws")
    for left in (1, 2, 3, 4, 6, 8):
        print(
            "   {:11d}".format(left)
            + "".join(
                "{:10.3f}".format(p_at_least_one(left, pool, d))
                for d in (4, 8, 12, 16)
            )
        )

    print(
        "\nB. What one visible copy is worth. A wait on a tile type with 4"
        " copies"
    )
    print("live, as copies appear in discards, with 10 draws remaining:")
    base = None
    for seen in (0, 1, 2, 3):
        left = 4 - seen
        p = p_at_least_one(left, pool, 10)
        if base is None:
            base = p
        print(
            "   {} copies visible -> {} live: P = {:.3f}  ({:+.1%} relative"
            " to none visible)".format(seen, left, p, p / base - 1)
        )

    print(
        "\n   The first visible copy costs about a sixth of the chance; the"
        " third"
    )
    print(
        "   costs more than half. This is the formal content of the ordinary"
        " advice"
    )
    print(
        "   to abandon a wait whose tiles are mostly gone, and the size"
        " of the"
    )
    print("   effect is set by the pool, not by intuition.")

    print(
        "\nC. A two-sided wait against a one-sided wait, same number of draws"
        " (10):"
    )
    for label, left in (("two-sided (8 live)", 8), ("one-sided (4 live)", 4),
                        ("pair wait (2 live)", 2)):
        print(
            "   {:22s} P = {:.3f}".format(
                label, p_at_least_one(left, pool, 10)
            )
        )
    ratio = p_at_least_one(8, pool, 10) / p_at_least_one(4, pool, 10)
    print(
        "   The two-sided wait is {:.2f} times the one-sided wait in"
        " probability of".format(ratio)
    )
    print(
        "   acceptance -- NOT twice the number of live tiles, because with"
        " ten draws"
    )
    print("   left both probabilities are already saturating.")

    print("\nD. How that ratio depends on how many draws remain:")
    print("   draws left   two-sided / one-sided ratio   stage of the hand")
    for d, stage in ((2, "late"), (4, "late"), (8, "middle"), (12, "early"),
                     (16, "very early")):
        a = p_at_least_one(8, pool, d)
        b = p_at_least_one(4, pool, d)
        print(
            "   {:10d} {:28.3f}   {}".format(
                d, a / b if b > 0 else float("nan"), stage
            )
        )
    print(
        "\n   Note the direction, which is easy to get backwards. FEW draws"
        " left"
    )
    print(
        "   means LATE in the hand, and there the ratio is {:.2f}, close to"
        " the 2.0".format(
            p_at_least_one(8, pool, 2) / p_at_least_one(4, pool, 2)
        )
    )
    print(
        "   that counting live tiles would predict. With many draws left --"
        " EARLY in"
    )
    print(
        "   the hand -- the ratio falls to {:.2f}, because both waits have"
        " time to be".format(
            p_at_least_one(8, pool, 16) / p_at_least_one(4, pool, 16)
        )
    )
    print("   hit and the probabilities saturate toward 1.")
    print(
        "   So counting acceptance tiles as proportional to the chance of"
        " completion"
    )
    print(
        "   is accurate LATE and overstates wide waits EARLY. The practical"
        " reading"
    )
    print(
        "   is the reverse of the usual emphasis: early in the hand the width"
        " of a"
    )
    print(
        "   wait matters less than it looks, and what matters more is the"
        " value of"
    )
    print("   the hand and the shape's flexibility (Chapter 4).")

    print(
        "\nE. The inference the pool does NOT support. The {} unseen tiles"
        " include".format(pool)
    )
    print(
        "   39 tiles in opponents' hands, and the hypergeometric calculation"
        " above"
    )
    print(
        "   treats them as if they were in the wall. That is wrong"
        " whenever an"
    )
    print(
        "   opponent is holding the tile BECAUSE it is useful to them,"
        " which is"
    )
    print(
        "   precisely the case for the tiles a player most wants. Chapter 3"
        " models"
    )
    print(
        "   that dependence; the numbers above are the no-dependence"
        " baseline and"
    )
    print("   are therefore optimistic for contested tiles.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《四人不完全信息随机博弈、贝叶斯读牌与反事实遗憾最小化》第 2 章「牌池:超几何推断与一个方向相反的结果」(版本 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}
}

本书其他章节结论