What does Human Go Decisions after AI conclude, in numbers, about “A Break in Time: Regression Discontinuity at March 2016”?
Answer: 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.
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: 0.258, 0.685, 12, 36
| part 1: placebo cutoffs inside 2011 to 2015, h = 12 | ||||
| placebo cutoffs 51, |z| > 1.96 in 4 (0.078) | ||||
| part 2: 400 redraws per world | ||||
| h | A mean | A reject | B mean | B reject |
| 6 | +0.298 | 0.405 | -0.005 | 0.083 |
| 12 | +0.301 | 0.685 | -0.009 | 0.070 |
| 24 | +0.231 | 0.757 | -0.063 | 0.102 |
| 36 | +0.208 | 0.838 | -0.097 | 0.258 |
Show the full program
# Chapter 2. p22: placebo cutoffs and repeated simulation of p21
# Same simulated worlds as p21 (World A: 0.30 jump in March 2016 and a
# 0.02 a month ramp from January 2017; World B: ramp only). Part 1
# moves the cutoff to every pre-AI month whose window stays inside
# 2010 to February 2016 and counts how often a false jump is "found".
# Part 2 redraws each world 400 times and reports the mean estimate
# and the share of runs with |z| > 1.96 at four bandwidths. All
# parameters are illustrative; the functions are copied from p21.
import math
import random
SEED = 20261112
MONTHS = 144
CUT = 74
RAMP0 = 84
REPS = 400
def series(rng, jump, ramp):
ys = []
for t in range(MONTHS):
parts = [98.0, 0.002 * (t - CUT), rng.gauss(0.0, 0.15)]
if t >= CUT:
parts.append(jump)
if t >= RAMP0:
parts.append(ramp * (t - RAMP0 + 1))
ys.append(math.fsum(parts))
return ys
def solve(a, b):
n = len(b)
m = [row[:] + [b[i]] + [1.0 if j == i else 0.0 for j in range(n)]
for i, row in enumerate(a)]
for c in range(n):
p = max(range(c, n), key=lambda r: abs(m[r][c]))
m[c], m[p] = m[p], m[c]
piv = m[c][c]
m[c] = [v / piv for v in m[c]]
for r in range(n):
if r != c:
f = m[r][c]
m[r] = [v - f * w for v, w in zip(m[r], m[c])]
return [m[i][n] for i in range(n)], [m[i][n + 1:] for i in range(n)]
def rd_jump(ys, cut, h):
xs, yy = [], []
for t, y in enumerate(ys):
if cut - h <= t < cut + h:
d = 1.0 if t >= cut else 0.0
r = float(t - cut)
xs.append([1.0, d, r, d * r])
yy.append(y)
xtx = [[math.fsum(x[i] * x[j] for x in xs) for j in range(4)]
for i in range(4)]
xty = [math.fsum(x[i] * y for x, y in zip(xs, yy)) for i in range(4)]
beta, inv = solve(xtx, xty)
res = [y - math.fsum(b * v for b, v in zip(beta, x))
for x, y in zip(xs, yy)]
s2 = math.fsum(r * r for r in res) / (len(yy) - 4)
return beta[1], math.sqrt(s2 * inv[1][1])
if __name__ == "__main__":
rng = random.Random(20261112)
world_a = series(rng, 0.30, 0.02)
fakes = list(range(12, CUT - 12 + 1))
hits = 0
for c in fakes:
j, s = rd_jump(world_a, c, 12)
if abs(j / s) > 1.96:
hits += 1
print("part 1: placebo cutoffs inside 2011 to 2015, h = 12")
print(" placebo cutoffs {}, |z| > 1.96 in {} ({:.3f})".format(
len(fakes), hits, hits / len(fakes)))
print("part 2: {} redraws per world".format(REPS))
print(" h A mean A reject B mean B reject")
for h in (6, 12, 24, 36):
rows = []
for jump in (0.30, 0.0):
est, rej = [], 0
for _ in range(REPS):
j, s = rd_jump(series(rng, jump, 0.02), CUT, h)
est.append(j)
if abs(j / s) > 1.96:
rej += 1
rows.append((math.fsum(est) / REPS, rej / REPS))
print(" {:2d} {:+.3f} {:.3f} {:+.3f} {:.3f}".format(
h, rows[0][0], rows[0][1], rows[1][0], rows[1][1]))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 2: A Break in Time: Regression Discontinuity at March 2016. 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 3 · Novel-Move Rates: the First Historically New Move, a Growing Database and the Memorisation Test
- Chapter 4 · Strategic Entropy: Joseki Concentration, Local Optima and Conformist Lock-In
- 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