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)
Lt1t2t3t4t5t6t7totalmiss7
150.971.882.673.353.924.404.8322.030.871
170.991.932.813.594.284.885.4123.890.748
190.991.972.903.764.565.275.9225.370.587
211.001.982.953.884.755.576.3326.460.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