What does Card Cost Regression and Cyclic Counters conclude, in numbers, about “Counterfactual Regret Minimisation: from a Three-Card Bluffing Duel to a Must-Pick Broken Deck”?

Answer: 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 under-costed card.

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.808

before patch: average strategy A C Cb M T S
1000 iterations0.065 0.126 0.000 0.001 0.000 0.808
10000 iterations0.006 0.013 0.000 0.000 0.000 0.981
200000 iterations0.000 0.001 0.000 0.000 0.000 0.999
top deck Surge share 0.999, worst matchup 0.54: BROKEN
after patch: average strategy A C Cb M T S
1000 iterations0.325 0.271 0.092 0.019 0.121 0.172
10000 iterations0.411 0.298 0.214 0.038 0.012 0.026
200000 iterations0.440 0.333 0.215 0.009 0.001 0.001
top deck Aggro share 0.440, worst matchup 0.40: no flag
Show the full program
# Chapter 5. p53: Sampled regret matching flags a must-pick broken deck.
# Five decks of p42 plus "Surge", built around the under-costed card
# Y07 of p11 (all win rates illustrative). Each iteration samples one
# opponent deck from the current strategy and one game result for every
# candidate deck (seed 20261112), then updates regrets: Monte Carlo CFR
# on the deck-choice move. Rule: a deck holding more than half of the
# average strategy is a broken-deck candidate; we confirm exactly that
# it wins at least half of every matchup. The patch moves Y07 to cost 4
# and lowers each Surge matchup by 0.07 (assumed; Chapter 6 estimates it).
import math
import random

D = ["Aggro", "Control", "Combo", "Midrange", "Tempo", "Surge"]
UP = {(0, 1): 40, (0, 2): 65, (0, 3): 60, (0, 4): 62,
      (1, 2): 30, (1, 3): 42, (1, 4): 45,
      (2, 3): 44, (2, 4): 46, (3, 4): 53}
SURGE = [0.56, 0.54, 0.58, 0.60, 0.63]
n = len(D)


def matrix(shift):
    W = [[0.5] * n for _ in range(n)]
    for (i, j), w in UP.items():
        W[i][j], W[j][i] = w / 100, 1 - w / 100
    for j, w in enumerate(SURGE):
        W[5][j] = w - shift
        W[j][5] = 1 - W[5][j]
    return W


def run(W, iters, rng):
    reg, tot = [0.0] * n, [0.0] * n
    marks = {}
    for t in range(1, iters + 1):
        pos = [max(r, 0.0) for r in reg]
        z = math.fsum(pos)
        x = [p / z for p in pos] if z > 0 else [1 / n] * n
        for i in range(n):
            tot[i] += x[i]
        j = rng.choices(range(n), weights=x)[0]
        o = [1.0 if rng.random() < W[i][j] else 0.0 for i in range(n)]
        ox = math.fsum(a * b for a, b in zip(x, o))
        for i in range(n):
            reg[i] += o[i] - ox
        if t in (1000, 10000, 200000):
            z = math.fsum(tot)
            marks[t] = [v / z for v in tot]
    return marks


rng = random.Random(20261112)
for label, shift in (("before patch", 0.0), ("after patch", 0.07)):
    W = matrix(shift)
    marks = run(W, 200000, rng)
    print(label + ": average strategy  A     C     Cb    M     T     S")
    for t, avg in marks.items():
        print("  {:6d} iterations    ".format(t)
              + " ".join("{:.3f}".format(v) for v in avg))
    avg = marks[200000]
    top = max(range(n), key=lambda i: avg[i])
    worst = min(W[top][j] for j in range(n) if j != top)
    flag = "BROKEN" if avg[top] > 0.5 and worst >= 0.5 else "no flag"
    print("  top deck {} share {:.3f}, worst matchup {:.2f}: {}".format(
        D[top], avg[top], worst, flag))

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 5: Counterfactual Regret Minimisation: from a Three-Card Bluffing Duel to a Must-Pick Broken Deck. 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