关于「超几何卡手率:起手七张、逐回合卡手与资源牌的可行区间」,《卡牌费用回归与循环克制》给出的定量结论是什么?
结论:第二章用超几何分布精确计算卡手率:资源 17 张的先手第 4 回合卡手概率是 0.293,若要求卡手与溢出都不超过四分之一,可行区间是 18 到 21 张。
数据口径:本书用一款自拟的示意卡牌游戏「衡枢」把这些问题写成可以运行的算术。 书中卡池、胜率与价格参数均为示意;全部计算由书中程序生成;本书不是法律、财务或投资建议,也不推荐任何购买。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.293, 17, 18, 21
| L | brick2 brick3 brick4 brick4d | flood | b4+fl | |||
| 14 | 0.140 | 0.310 | 0.508 | 0.404 | 0.009 | 0.517 |
| 15 | 0.108 | 0.251 | 0.432 | 0.329 | 0.017 | 0.449 |
| 16 | 0.082 | 0.200 | 0.360 | 0.261 | 0.029 | 0.389 |
| 17 | 0.061 | 0.155 | 0.293 | 0.201 | 0.047 | 0.340 |
| 18 | 0.044 | 0.118 | 0.233 | 0.151 | 0.073 | 0.306 |
| 19 | 0.031 | 0.088 | 0.181 | 0.110 | 0.107 | 0.288 |
| 20 | 0.022 | 0.064 | 0.137 | 0.078 | 0.150 | 0.287 |
| 21 | 0.015 | 0.045 | 0.100 | 0.053 | 0.204 | 0.304 |
| 22 | 0.010 | 0.031 | 0.071 | 0.034 | 0.268 | 0.339 |
| 23 | 0.006 | 0.020 | 0.049 | 0.021 | 0.341 | 0.389 |
| band with brick4 and flood both <= 0.25: L = 18 to 21 | ||||||
| smallest brick4 + flood: L = 20 (0.287) | ||||||
| second player at L = 17 bricks like first player at L = 19 |
核心公式
\[P(X = x) = \frac{\binom{L}{x}\binom{40 - L}{n - x}}{\binom{40}{n}}\]
查看完整验算程序
# Chapter 2. p22: Brick and flood rates by turn, and the best resource band.
# Invented rules (illustrative): 40 cards, L resources, 7-card hand, one
# draw per turn; the first player skips the draw on turn 1. By turn t the
# first player has seen 6 + t cards, the second player 7 + t.
# brick(t): fewer than t resources among the cards seen by turn t
# flood : 8 or more resources among the 12 cards seen by turn 6 (play)
# All values exact (math.comb). The band keeps brick(4) and flood <= 0.25.
import math
N, CAP = 40, 0.25
def below(L, seen, k):
tot = 0
for x in range(k):
tot += math.comb(L, x) * math.comb(N - L, seen - x)
return tot / math.comb(N, seen)
print("L brick2 brick3 brick4 brick4d flood b4+fl")
band, score = [], []
for L in range(14, 24):
b = [below(L, 6 + t, t) for t in (2, 3, 4)]
b4d = below(L, 11, 4)
fl = 1 - below(L, 12, 8)
tot = b[2] + fl
score.append((tot, L))
if b[2] <= CAP and fl <= CAP:
band.append(L)
print("{:2d} {:6.3f} {:6.3f} {:6.3f} {:7.3f} {:6.3f} {:6.3f}".format(
L, b[0], b[1], b[2], b4d, fl, tot))
print("band with brick4 and flood both <= {}: L = {} to {}".format(
CAP, band[0], band[-1]))
tot, L = min(score)
print("smallest brick4 + flood: L = {} ({:.3f})".format(L, tot))
print("second player at L = 17 bricks like first player at L = {}".format(
min(L for L in range(14, 30) if below(L, 10, 4) <= below(17, 11, 4))))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《非对称策略卡牌费用收益回归、牌库构筑超几何卡手率边界与优势策略循环克制》第 2 章「超几何卡手率:起手七张、逐回合卡手与资源牌的可行区间」(版本 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}
}