Cost-Benefit Regression for Asymmetric Strategy Cards, Hypergeometric Brick-Rate Bounds in Deck Building and Cyclic Counters to Dominant Strategies: chapter answers
Before a physical strategy card game goes to print, its designers and publisher must answer three kinds of question: is each card's cost right, how many resources should a deck hold so that it seldom stalls, and will a set of decks that counter one another be displaced by a deck that loses to nobody? This book turns these questions into runnable arithmetic using Hengshu, an invented, illustrative card game. 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.
DOI pending · monograph page goes live after publication · 5DL-B-179 · 中文版
- Chapter 1 · Cost-Benefit Regression: Least Squares Finds the Under-Costed and the Over-Costed
Chapter 1 uses least squares to find under-costed and over-costed cards: each point of cost buys 1.858 stat points on average, and a multiple regression shows that health is dearer than attack and that keywords are wort… - Chapter 2 · Hypergeometric Brick Rates: the Seven-Card Hand, Turn-by-Turn Bricks and a Feasible Band of Resources
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… - Chapter 3 · The Mana Curve: a Markov Chain for Expected Available Mana and a Simulation of Mana Spent
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 th… - Chapter 4 · Cyclic Counters: the Mixed Equilibrium of a Symmetric Zero-Sum Matrix Game and a Counter-Intuitive Patch Effect
Chapter 4 solves the mixed equilibrium of counter cycles: strengthening aggro raises the share of control, its counter, by 0.121. - Chapter 5 · Counterfactual Regret Minimisation: from a Three-Card Bluffing Duel to a Must-Pick Broken Deck
Chapter 5 implements counterfactual regret minimisation, approaches the theoretical value of −0.0556 in a three-card bluffing duel, and within a thousand iterations hands 0.808 of the share to a broken deck built on an… - Chapter 6 · Testing for a Must-Pick Broken Deck and Regression Checks on Balance Patches
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. - Chapter 7 · The Classics Examined: Ban Gu's Essay on the Purport of Go and von Neumann's Theory of Parlour Games
Chapter 7 reads Ban Gu's Essay on the Purport of Go against von Neumann's paper of 1928: brick probability raises the games needed to rank players from 41 to 119. - Chapter 8 · Practice and Falsification: a Publisher's Checklist, a Pricing Calculator and Pre-Registered Tests
Chapter 8 gives a publisher's checklist, a pricing calculator (a named super rare appears in a box with probability only 0.182) and a pre-registered test protocol. Marked boxes separate published evidence, runnable Pyth…
Illustrative model calculation, not a live quote