What does Card Cost Regression and Cyclic Counters conclude, in numbers, about “Testing for a Must-Pick Broken Deck and Regression Checks on Balance Patches”?
Answer: Chapter 6 computes the games needed to detect such a deck and the prediction interval of a patch; a one-point cost increase still has a 0.407 chance of falling short.
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.407
patches 18: dw = +0.0056 + 0.0354 * dr slope se 0.0012, intercept se 0.0022, R^2 0.982 through the origin: slope 0.0354 mean residual, nerfs +0.0018, buffs -0.0018 Durbin-Watson 2.25 (near 2: no drift across patches) Y07 to cost 4: predicted dw -0.0601, 95% PI -0.0810 to -0.0392 needed to bring Surge to 0.5 vs the Nash field: -0.0578 chance the patch is not enough (normal approx): 0.407
Show the full program
# Chapter 6. p62: Regression diagnostics for balance patches.
# An invented patch history (illustrative, seed 20261112): 18 past card
# changes, each moving a deck's key card by dr stat points against the
# p11 cost line, with the deck's field win rate then moving by dw. True
# model used to make the data: dw = 0.036 * dr + noise (sd 0.012).
# We fit dw on dr through the origin and with an intercept, check the
# residuals, and predict the patch that moves Y07 from cost 3 to cost 4
# (dr = -1.858, one cost step on the p11 line), with a 95% prediction
# interval from the t quantile for 16 degrees of freedom.
import math
import random
rng = random.Random(20261112)
DR = [-3, -2.5, -2, -2, -1.5, -1, -1, -0.5, 0.5, 1, 1, 1.5, 2, 2,
2.5, 3, -1.5, 1.5]
DW = [0.036 * r + rng.gauss(0, 0.012) for r in DR]
n = len(DR)
T16 = 2.120
mx = math.fsum(DR) / n
my = math.fsum(DW) / n
sxx = math.fsum((x - mx) ** 2 for x in DR)
sxy = math.fsum((x - mx) * (y - my) for x, y in zip(DR, DW))
b = sxy / sxx
a = my - b * mx
res = [y - a - b * x for x, y in zip(DR, DW)]
s = math.sqrt(math.fsum(e * e for e in res) / (n - 2))
se_b = s / math.sqrt(sxx)
se_a = s * math.sqrt(1 / n + mx * mx / sxx)
syy = math.fsum((y - my) ** 2 for y in DW)
print("patches {}: dw = {:+.4f} + {:.4f} * dr".format(n, a, b))
print("slope se {:.4f}, intercept se {:.4f}, R^2 {:.3f}".format(
se_b, se_a, 1 - math.fsum(e * e for e in res) / syy))
b0 = math.fsum(x * y for x, y in zip(DR, DW)) / math.fsum(
x * x for x in DR)
print("through the origin: slope {:.4f}".format(b0))
lo = [e for x, e in zip(DR, res) if x < 0]
hi = [e for x, e in zip(DR, res) if x > 0]
print("mean residual, nerfs {:+.4f}, buffs {:+.4f}".format(
math.fsum(lo) / len(lo), math.fsum(hi) / len(hi)))
dw_ = math.fsum((res[i] - res[i - 1]) ** 2 for i in range(1, n))
print("Durbin-Watson {:.2f} (near 2: no drift across patches)".format(
dw_ / math.fsum(e * e for e in res)))
x0 = -1.858
pred = a + b * x0
half = T16 * s * math.sqrt(1 + 1 / n + (x0 - mx) ** 2 / sxx)
print("Y07 to cost 4: predicted dw {:+.4f}, 95% PI {:+.4f} to {:+.4f}"
.format(pred, pred - half, pred + half))
need = 0.5578 - 0.5
print("needed to bring Surge to 0.5 vs the Nash field: {:+.4f}".format(
-need))
sd = half / T16
print("chance the patch is not enough (normal approx): {:.3f}".format(
0.5 * math.erfc((-need - pred) / (sd * math.sqrt(2)))))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 6: Testing for a Must-Pick Broken Deck and Regression Checks on Balance Patches. 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 7 · The Classics Examined: Ban Gu's Essay on the Purport of Go and von Neumann's Theory of Parlour Games
- Chapter 8 · Practice and Falsification: a Publisher's Checklist, a Pricing Calculator and Pre-Registered Tests