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

Lbrick2 brick3 brick4 brick4dfloodb4+fl
140.1400.3100.5080.4040.0090.517
150.1080.2510.4320.3290.0170.449
160.0820.2000.3600.2610.0290.389
170.0610.1550.2930.2010.0470.340
180.0440.1180.2330.1510.0730.306
190.0310.0880.1810.1100.1070.288
200.0220.0640.1370.0780.1500.287
210.0150.0450.1000.0530.2040.304
220.0100.0310.0710.0340.2680.339
230.0060.0200.0490.0210.3410.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

\[P(X = x) = \frac{\binom{L}{x}\binom{40 - L}{n - x}}{\binom{40}{n}}\]
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