关于「实践与证伪方案:发行商清单、定价试算器与预注册检验」,《卡牌费用回归与循环克制》给出的定量结论是什么?
结论:第八章给出发行商清单、定价试算器(指定超稀有一盒内出现的概率只有 0.182)与预注册检验方案。书中以标注框区分已发表的证据、可运行的 Python 计算(21 段程序)、原典与作者的假说。
数据口径:本书用一款自拟的示意卡牌游戏「衡枢」把这些问题写成可以运行的算术。 书中卡池、胜率与价格参数均为示意;全部计算由书中程序生成;本书不是法律、财务或投资建议,也不推荐任何购买。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.182
| cost stat budget (value = attack + health + 2 * keyword) | |
| 1 | 3.39 |
| 2 | 5.25 |
| 3 | 7.11 |
| 4 | 8.96 |
| 5 | 10.82 |
| 6 | 12.68 |
| 7 | 14.54 |
| chance a pack holds one named super rare | 1/120 = 0.00833 |
| expected packs for it | 120 (price 1800.0) |
| chance a box of 24 packs holds it | 0.182 |
| expected packs to own all 40 rares | 195.6 (price 2934) |
| expected rares per box 21.00, super rares 3.00 | |
| expected list value of a pack 16.75 vs price 15: ratio 1.117 | |
| a fixed-price single at 8 packs' price would cost 120 |
查看完整验算程序
# Chapter 8. p81: A pricing calculator for an invented card game.
# All parameters are illustrative defaults, not market data.
# 1) Cost baseline: stat budget = 1.533 + 1.858 * cost (the p11 line).
# 2) Booster of 10 cards: 7 common, 2 uncommon, 1 rare slot; the rare
# slot holds a super rare with a published chance of 1/8. Set: 100
# common, 60 uncommon, 40 rare, 15 super rare titles, equally likely
# within a rarity. Only expected values and published odds are
# computed; random-pack sales must follow local rules on disclosure.
# 3) Price per pack 15 (currency units), 24 packs per box; list prices
# of singles by rarity 0.5, 1.5, 6 and 40 for the expected pack value.
from fractions import Fraction as F
import math
A0, B1 = 1.533, 1.858
PRICE, BOX = 15, 24
SR, N_R, N_SR = F(1, 8), 40, 15
print("cost stat budget (value = attack + health + 2 * keyword)")
for c in range(1, 8):
print("{:4d} {:12.2f}".format(c, A0 + B1 * c))
one_sr = SR / N_SR
one_r = (1 - SR) / N_R
print("chance a pack holds one named super rare: {} = {:.5f}".format(
one_sr, float(one_sr)))
print("expected packs for it: {} (price {})".format(
1 / one_sr, float(1 / one_sr * PRICE)))
box = 1 - (1 - one_sr) ** BOX
print("chance a box of {} packs holds it: {:.3f}".format(BOX, float(box)))
harm = math.fsum(1 / k for k in range(1, N_R + 1))
need = harm * N_R / float(1 - SR)
print("expected packs to own all {} rares: {:.1f} (price {:.0f})".format(
N_R, need, need * PRICE))
print("expected rares per box {:.2f}, super rares {:.2f}".format(
float(BOX * (1 - SR)), float(BOX * SR)))
LIST = {"common": F(1, 2), "uncommon": F(3, 2), "rare": F(6),
"super rare": F(40)}
ev = (7 * LIST["common"] + 2 * LIST["uncommon"]
+ (1 - SR) * LIST["rare"] + SR * LIST["super rare"])
print("expected list value of a pack {:.2f} vs price {}: ratio {:.3f}"
.format(float(ev), PRICE, float(ev / PRICE)))
print("a fixed-price single at 8 packs' price would cost {}".format(
8 * PRICE))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《非对称策略卡牌费用收益回归、牌库构筑超几何卡手率边界与优势策略循环克制》第 8 章「实践与证伪方案:发行商清单、定价试算器与预注册检验」(版本 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}
}