What does Card Cost Regression and Cyclic Counters conclude, in numbers, about “Practice and Falsification: a Publisher's Checklist, a Pricing Calculator and Pre-Registered Tests”?
Answer: Chapter 8 gives a publisher's checklist, a pricing calculator (a named super rare appears in a box with probability only 0.182) and a pre-registered test protocol. Marked boxes separate published evidence, runnable Python calculations (21 programs), classical sources and the author's hypotheses.
Scope of the numbers: Its card pool, win rates and prices are illustrative; all calculations are generated by its programs; the book is not legal, financial or investment advice and recommends no purchase. Marked boxes separate published evidence, runnable Python calculations (21 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 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 |
Show the full program
# 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))Single source and citation
Fan, Y. (2026). Cost-Benefit Regression for Asymmetric Strategy Cards, Hypergeometric Brick-Rate Bounds in Deck Building and Cyclic Counters to Dominant Strategies (Version 1.0.0), Chapter 8: Practice and Falsification: a Publisher's Checklist, a Pricing Calculator and Pre-Registered Tests. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 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}
}Other chapter answers in this book
- Chapter 1 · Cost-Benefit Regression: Least Squares Finds the Under-Costed and the Over-Costed
- Chapter 2 · Hypergeometric Brick Rates: the Seven-Card Hand, Turn-by-Turn Bricks and a Feasible Band of Resources
- Chapter 3 · The Mana Curve: a Markov Chain for Expected Available Mana and a Simulation of Mana Spent
- Chapter 4 · Cyclic Counters: the Mixed Equilibrium of a Symmetric Zero-Sum Matrix Game and a Counter-Intuitive Patch Effect
- Chapter 5 · Counterfactual Regret Minimisation: from a Three-Card Bluffing Duel to a Must-Pick Broken Deck
- Chapter 6 · Testing for a Must-Pick Broken Deck and Regression Checks on Balance Patches
- Chapter 7 · The Classics Examined: Ban Gu's Essay on the Purport of Go and von Neumann's Theory of Parlour Games