关于「原典考辨:班固《弈旨》与冯·诺依曼《论室内游戏理论》」,《卡牌费用回归与循环克制》给出的定量结论是什么?

结论:第七章对读班固《弈旨》与冯·诺依曼 1928 年的论文:卡手概率让排定等级所需的局数从 41 局升到 119 局。

数据口径:本书用一款自拟的示意卡牌游戏「衡枢」把这些问题写成可以运行的算术。 书中卡池、胜率与价格参数均为示意;全部计算由书中程序生成;本书不是法律、财务或投资建议,也不推荐任何购买。

English version

对照数据表

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

settingone gamebest of 3best of 7odd n for 0.9
yi, q = 00.6000.6480.71041
q = 0.1370.5760.6140.66371
q = 0.2930.5590.5870.626119
bo (dice)0.5000.5000.500never
at q = 0.293 the better player still loses a best of 3 with chance 0.413
查看完整验算程序
# Chapter 7. p71: Ban Gu's contrast of dice games and Go, as arithmetic.
# Illustrative model. When neither or both players brick, the better
# player wins a game with probability 0.60; when exactly one bricks, the
# other wins with probability 0.85. The brick chances q are exact values
# from p22 (turn 4, first player): 0.137 at 20 resources, 0.293 at 17.
# q = 0 is a pure skill game (Ban Gu's yi); a dice game (his bo) gives
# the better player 0.5. Series of n games are won by a majority.
from fractions import Fraction as F
import math

P_SKILL, P_ONE = F(60, 100), F(85, 100)


def game(q):
    q = F(q).limit_denominator(1000)
    both_same = (1 - q) ** 2 + q ** 2
    return P_SKILL * both_same + q * (1 - q) * (P_ONE + 1 - P_ONE)


def series(p, n):
    need = n // 2 + 1
    out = F(0)
    for k in range(need, n + 1):
        out += math.comb(n, k) * p ** k * (1 - p) ** (n - k)
    return out


def games_for(p, target):
    n = 1
    while series(p, n) < target:
        n += 2
    return n


rows = [("yi, q = 0", game(0)), ("q = 0.137", game("0.137")),
        ("q = 0.293", game("0.293")), ("bo (dice)", F(1, 2))]
print("setting     one game  best of 3  best of 7  odd n for 0.9")
for name, p in rows:
    if p == F(1, 2):
        need = "never"
    else:
        need = str(games_for(p, F(9, 10)))
    print("{:10} {:9.3f} {:10.3f} {:10.3f} {:>13}".format(
        name, float(p), float(series(p, 3)), float(series(p, 7)), need))
p = game("0.293")
print("at q = 0.293 the better player still loses a best of 3 with"
      " chance {:.3f}".format(float(1 - series(p, 3))))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《非对称策略卡牌费用收益回归、牌库构筑超几何卡手率边界与优势策略循环克制》第 7 章「原典考辨:班固《弈旨》与冯·诺依曼《论室内游戏理论》」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-179 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026179,
  author    = {Fan, Yafu},
  title     = {Cost-Benefit Regression for Asymmetric Strategy Cards, Hypergeometric Brick-Rate Bounds in Deck Building and Cyclic Counters to Dominant Strategies},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论