What does Human Go Decisions after AI conclude, in numbers, about “Strategic Entropy: Joseki Concentration, Local Optima and Conformist Lock-In”?
Answer: Chapter 4 measures joseki concentration with Shannon entropy; the strategic entropy of an illustrative corner position rises from 1.608 to 2.360 bits, and a model of conformist learning shows an outside evaluator bringing forward the escape from a local optimum by about 12 years.
Scope of the numbers: Apart from the paper's figures, all parameters are illustrative and all calculations are generated by the book's programs; the book is non-personalised business guidance and addresses no individual decision. Chapter 2 demonstrates regression discontinuity in time on simulated data: with a true jump of 0.30 a 12-month bandwidth detects it only 0.685 of the time, while a world with nothing but a ramp is declared significant with probability 0.258 at 36 months.
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: 1.608, 2.360
| era H bits MM bits | 2^H 95 % bootstrap CI top share |
| pre | 1.608 1.612 3.05 [1.517, 1.690] 0.620 |
| post | 2.360 2.364 5.13 [2.313, 2.397] 0.300 |
| maximum for 6 options | 2.585 bits |
| Jensen-Shannon divergence pre vs post | 0.0928 bits |
| small samples from the post-AI law (300 draws each): | |
| n mean plug-in H mean Miller-Madow H | |
| 10 | 1.907 2.149 |
| 30 | 2.238 2.351 |
| 100 | 2.323 2.359 |
| 1000 | 2.357 2.360 |
Show the full program
# Chapter 4. p41: strategic entropy of a choice point, with error bars
# Model (illustrative counts, not real game statistics): how 1000
# professional games answered one standard corner position, before
# and after the AI era, over six named options. Strategic entropy is
# Shannon's H in bits; 2^H is the effective number of options. The
# Miller-Madow term (K - 1) / (2 N ln 2) corrects the plug-in bias;
# a seeded bootstrap (500 resamples) gives 95 % intervals. The last
# block shows how badly H is underestimated from a small sample.
import math
import random
SEED = 20261112
OPTIONS = ["A", "B", "C", "D", "E", "F"]
PRE = [620, 210, 90, 50, 20, 10]
POST = [300, 250, 200, 120, 80, 50]
def entropy(counts):
n = math.fsum(counts)
return -math.fsum(c / n * math.log2(c / n) for c in counts if c > 0)
def miller_madow(counts):
n = math.fsum(counts)
k = len([c for c in counts if c > 0])
return entropy(counts) + (k - 1) / (2.0 * n * math.log(2.0))
def resample(rng, counts, n):
pool = []
for i, c in enumerate(counts):
pool.extend([i] * c)
out = [0] * len(counts)
for _ in range(n):
out[rng.choice(pool)] += 1
return out
def boot_ci(rng, counts, reps=500):
n = int(math.fsum(counts))
hs = sorted(entropy(resample(rng, counts, n)) for _ in range(reps))
return hs[int(0.025 * reps)], hs[int(0.975 * reps) - 1]
def js_div(a, b):
na, nb = math.fsum(a), math.fsum(b)
p = [x / na for x in a]
q = [x / nb for x in b]
m = [(x + y) / 2.0 for x, y in zip(p, q)]
def kl(u, v):
return math.fsum(x * math.log2(x / y) for x, y in zip(u, v)
if x > 0)
return (kl(p, m) + kl(q, m)) / 2.0
if __name__ == "__main__":
rng = random.Random(20261112)
print("era H bits MM bits 2^H 95 % bootstrap CI top share")
for name, c in (("pre ", PRE), ("post", POST)):
h = entropy(c)
lo, hi = boot_ci(rng, c)
print("{} {:.3f} {:.3f} {:.2f} [{:.3f}, {:.3f}]"
" {:.3f}".format(name, h, miller_madow(c), 2 ** h,
lo, hi, max(c) / math.fsum(c)))
print("maximum for 6 options: {:.3f} bits".format(math.log2(6)))
print("Jensen-Shannon divergence pre vs post: {:.4f} bits".format(
js_div(PRE, POST)))
print("small samples from the post-AI law (300 draws each):")
print(" n mean plug-in H mean Miller-Madow H")
for n in (10, 30, 100, 1000):
hp, hm = [], []
for _ in range(300):
s = resample(rng, POST, n)
hp.append(entropy(s))
hm.append(miller_madow(s))
print(" {:4d} {:.3f} {:.3f}".format(
n, math.fsum(hp) / 300, math.fsum(hm) / 300))Single source and citation
Fan, Y. (2026). Post-AI Leaps in Human Go Decision Quality, Novel-Move Rates and Strategic Entropy in the Thirteen-Chapter Classic of Go (Version 1.0.0), Chapter 4: Strategic Entropy: Joseki Concentration, Local Optima and Conformist Lock-In. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-230 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026230,
author = {Fan, Yafu},
title = {Post-AI Leaps in Human Go Decision Quality, Novel-Move Rates and Strategic Entropy in the Thirteen-Chapter Classic of Go},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Leap at the Break: a Decision Quality Index on a KataGo Yardstick
- Chapter 2 · A Break in Time: Regression Discontinuity at March 2016
- Chapter 3 · Novel-Move Rates: the First Historically New Move, a Growing Database and the Memorisation Test
- Chapter 5 · The Contest over Mechanism: Internalisation, Memorisation and Composition
- Chapter 6 · The Limits of the Yardstick: Evaluator Noise, Engine Versions and the Win-Rate Ceiling
- Chapter 7 · Classics East and West: the Classic of Go in Thirteen Chapters and Franklin's The Morals of Chess
- Chapter 8 · Closing the Loop: a Team Routine for AI Reviews and an Audit of Editorial Decision Quality