What does Card Cost Regression and Cyclic Counters conclude, in numbers, about “Hypergeometric Brick Rates: the Seven-Card Hand, Turn-by-Turn Bricks and a Feasible Band of Resources”?
Answer: Chapter 2 computes brick rates exactly with the hypergeometric distribution: a first player with seventeen resources bricks on turn four with probability 0.293, and if neither bricks nor floods may exceed a quarter the feasible band is 18 to 21 resources.
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.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 |
Key formula
Show the full program
# 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))))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 2: Hypergeometric Brick Rates: the Seven-Card Hand, Turn-by-Turn Bricks and a Feasible Band of Resources. 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 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
- Chapter 8 · Practice and Falsification: a Publisher's Checklist, a Pricing Calculator and Pre-Registered Tests