What does Card Cost Regression and Cyclic Counters conclude, in numbers, about “The Classics Examined: Ban Gu's Essay on the Purport of Go and von Neumann's Theory of Parlour Games”?
Answer: 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.
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: 119, 41
| setting | one game | best of 3 | best of 7 | odd n for 0.9 |
| yi, q = 0 | 0.600 | 0.648 | 0.710 | 41 |
| q = 0.137 | 0.576 | 0.614 | 0.663 | 71 |
| q = 0.293 | 0.559 | 0.587 | 0.626 | 119 |
| bo (dice) | 0.500 | 0.500 | 0.500 | never |
| at q = 0.293 the better player still loses a best of 3 with chance 0.413 |
Show the full program
# Chapter 7. p71: Ban Gu's contrast of dice games and Go, as arithmetic.
# Illustrative model. When neither or both players brick, the better
# player wins a game with probability 0.60; when exactly one bricks, the
# other wins with probability 0.85. The brick chances q are exact values
# from p22 (turn 4, first player): 0.137 at 20 resources, 0.293 at 17.
# q = 0 is a pure skill game (Ban Gu's yi); a dice game (his bo) gives
# the better player 0.5. Series of n games are won by a majority.
from fractions import Fraction as F
import math
P_SKILL, P_ONE = F(60, 100), F(85, 100)
def game(q):
q = F(q).limit_denominator(1000)
both_same = (1 - q) ** 2 + q ** 2
return P_SKILL * both_same + q * (1 - q) * (P_ONE + 1 - P_ONE)
def series(p, n):
need = n // 2 + 1
out = F(0)
for k in range(need, n + 1):
out += math.comb(n, k) * p ** k * (1 - p) ** (n - k)
return out
def games_for(p, target):
n = 1
while series(p, n) < target:
n += 2
return n
rows = [("yi, q = 0", game(0)), ("q = 0.137", game("0.137")),
("q = 0.293", game("0.293")), ("bo (dice)", F(1, 2))]
print("setting one game best of 3 best of 7 odd n for 0.9")
for name, p in rows:
if p == F(1, 2):
need = "never"
else:
need = str(games_for(p, F(9, 10)))
print("{:10} {:9.3f} {:10.3f} {:10.3f} {:>13}".format(
name, float(p), float(series(p, 3)), float(series(p, 7)), need))
p = game("0.293")
print("at q = 0.293 the better player still loses a best of 3 with"
" chance {:.3f}".format(float(1 - series(p, 3))))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 7: The Classics Examined: Ban Gu's Essay on the Purport of Go and von Neumann's Theory of Parlour Games. 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 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 8 · Practice and Falsification: a Publisher's Checklist, a Pricing Calculator and Pre-Registered Tests