What does Card Cost Regression and Cyclic Counters conclude, in numbers, about “The Mana Curve: a Markov Chain for Expected Available Mana and a Simulation of Mana Spent”?
Answer: Expected available mana is not the smaller of turn number and resources seen; it is a Markov chain in which a missed drop is never recovered. A first player with seventeen resources expects only 23.89 mana-turns over the first seven turns and misses at least one drop with probability 0.748. Available is not spent: the low-curve deck spends less because its hand runs dry and does best with sixteen resources, while the high-curve deck does best with nineteen. The next chapter leaves the single deck and turns to the counter relations between decks.
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.748, 17, 19, 23.89
| expected mana in play, first player (ideal = turn number) | |||||||||
| L | t1 | t2 | t3 | t4 | t5 | t6 | t7 | total | miss7 |
| 15 | 0.97 | 1.88 | 2.67 | 3.35 | 3.92 | 4.40 | 4.83 | 22.03 | 0.871 |
| 17 | 0.99 | 1.93 | 2.81 | 3.59 | 4.28 | 4.88 | 5.41 | 23.89 | 0.748 |
| 19 | 0.99 | 1.97 | 2.90 | 3.76 | 4.56 | 5.27 | 5.92 | 25.37 | 0.587 |
| 21 | 1.00 | 1.98 | 2.95 | 3.88 | 4.75 | 5.57 | 6.33 | 26.46 | 0.413 |
| L = 17, second player gains 1.083 mana-turns over turns 1-7 | |||||||||
| ideal total over 7 turns = 28 mana-turns |
Show the full program
# Chapter 3. p31: Expected mana in play by turn, an exact Markov chain.
# Invented rules (illustrative): 40 cards, L resources, 7-card hand, one
# resource may be played per turn, the first player skips the turn-1
# draw. State = (resources seen r, resources in play m). Each draw is a
# resource with probability (L - r) / (40 - n); then m <- min(m + 1, r).
# Exact fractions; E[m_t] is the mana available on turn t.
import math
from fractions import Fraction as F
N, HAND, TURNS = 40, 7, 7
def chain(L, first):
dist = {}
for r in range(HAND + 1):
p = F(math.comb(L, r) * math.comb(N - L, HAND - r),
math.comb(N, HAND))
if p:
dist[(r, 0)] = p
seen = HAND
out = []
for t in range(1, TURNS + 1):
nxt = {}
for (r, m), p in dist.items():
if t == 1 and first:
opts = [(r, p)]
else:
q = F(L - r, N - seen)
opts = [(r + 1, p * q), (r, p * (1 - q))]
for r2, p2 in opts:
if p2:
k = (r2, min(m + 1, r2))
nxt[k] = nxt.get(k, 0) + p2
if not (t == 1 and first):
seen += 1
dist = nxt
em = math.fsum(float(p * m) for (r, m), p in dist.items())
miss = math.fsum(float(p) for (r, m), p in dist.items() if m < t)
out.append((em, miss))
return out
print("expected mana in play, first player (ideal = turn number)")
print("L t1 t2 t3 t4 t5 t6 t7 total miss7")
for L in (15, 17, 19, 21):
o = chain(L, True)
tot = math.fsum(e for e, _ in o)
print("{:2d} ".format(L) + " ".join("{:5.2f}".format(e) for e, _ in o)
+ " {:6.2f} {:6.3f}".format(tot, o[-1][1]))
o1, o2 = chain(17, True), chain(17, False)
gap = math.fsum(b for b, _ in o2) - math.fsum(a for a, _ in o1)
print("L = 17, second player gains {:.3f} mana-turns over turns 1-7"
.format(gap))
ideal = TURNS * (TURNS + 1) // 2
print("ideal total over 7 turns = {} mana-turns".format(ideal))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 3: The Mana Curve: a Markov Chain for Expected Available Mana and a Simulation of Mana Spent. 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 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