What does Red-Blue Synthetic-Customer Sandboxes conclude, in numbers, about “The Classics Examined: Sunzi on Knowing the Other Side and Oneself, and Reisswitz's War Game of 1824”?

Answer: Chapter 7 examines Sunzi on knowing the other side and oneself and Reisswitz's war game of 1824, showing that an informed umpire lets a script with no advantage win 0.5215 of comparisons.

Scope of the numbers: Parameters are illustrative; all calculations are generated by the book's programs, which call no model interface. This is not individual business advice.

中文版

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

umpirefav cutP(fav ahead by 3 pts)median gap
blind40.2223+0.0000
leaning30.3633+0.0167
strong lean20.5215+0.0333
expected lean: 0.0167 per buyer (ambiguous share x 1/6)
Show the full program
# Chapter 7. p72: dice are honest; an umpire who knows the favourite
# is not. In the 1824 Kriegsspiel an umpire resolved combat with dice
# and simple arithmetic on a map at scale 1:8000. Sandbox analogue
# (illustrative): two scripts with the same true quality face 240
# synthetic buyers each; 20 per
# cent of buyers clearly buy, 10 per cent are ambiguous transcripts
# that the umpire resolves with a six-sided die. A blind umpire counts
# an ambiguous case as a sale on 4 to 6; an umpire who knows which
# script is the house favourite counts it on 3 to 6 for that script.
# We count how often the favourite is declared better by at least 3
# points, over 4000 seeded duels.
import random

N, CLEAR, AMBIG, DUELS = 240, 0.20, 0.10, 4000


def sales(rng, cut):
    k = 0
    for _ in range(N):
        u = rng.random()
        if u < CLEAR:
            k += 1
        elif u < CLEAR + AMBIG and rng.randint(1, 6) >= cut:
            k += 1
    return k


rng = random.Random(20261113)
print("umpire        fav cut  P(fav ahead by 3 pts)  median gap")
for label, cut in (("blind", 4), ("leaning", 3), ("strong lean", 2)):
    wins, gaps = 0, []
    for _ in range(DUELS):
        a = sales(rng, cut) / N
        b = sales(rng, 4) / N
        gaps.append(a - b)
        wins += a - b >= 0.03
    gaps.sort()
    print("%-12s  %7d  %21.4f  %+10.4f"
          % (label, cut, wins / DUELS, gaps[DUELS // 2]))
print("expected lean: %.4f per buyer (ambiguous share x 1/6)"
      % (AMBIG / 6))

Single source and citation

Fan, Y. (2026). Red-Blue Synthetic-Customer Sandboxes: Multi-Round Bargaining against Parameterised Demanding Buyers and Pre-Launch Leak Detection (Version 1.0.0), Chapter 7: The Classics Examined: Sunzi on Knowing the Other Side and Oneself, and Reisswitz's War Game of 1824. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-259 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026259,
  author    = {Fan, Yafu},
  title     = {Red-Blue Synthetic-Customer Sandboxes: Multi-Round Bargaining against Parameterised Demanding Buyers and Pre-Launch Leak Detection},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book