What does Human Go Decisions after AI conclude, in numbers, about “The Leap at the Break: a Decision Quality Index on a KataGo Yardstick”?
Answer: Chapter 1 turns the paper's Table 1 into effect sizes: after AI an ordinary move's Decision Quality Index is 0.59754 points higher, a novel move's 1.11258 points, and the old penalty for novelty shrinks by 0.848; it also shows that median summaries hit a ceiling once more than half of moves match the AI.
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.59754, 0.848, 1.11258
| term est se z | 95 % CI |
| after AI (b1) | 0.59754 0.01601 37.3 [0.5662, 0.6289] |
| novel (b2) | -0.60770 0.01219 -49.9 [-0.6316, -0.5838] |
| after x novel (b3) | 0.51504 0.02147 24.0 [0.4730, 0.5571] |
| model 2 b3 | 0.51498, se 0.02132: same to 4 decimals |
| cell means relative to pre-AI, non-novel moves (DQI points) | |
| pre-AI non-novel +0.00000 | |
| pre-AI novel | -0.60770 |
| post-AI non-novel +0.59754 | |
| post-AI novel +0.50488 | |
| AI gain, non-novel moves | 0.59754 |
| AI gain, novel moves | 1.11258 (1.862 x) |
| novelty penalty before | -0.60770 |
| novelty penalty after | -0.09266 |
| worst-case se of b1 + b3 | 0.03748, lower 95 % bound 1.0391 |
| share of b2 penalty removed by b3 | 0.848 |
Show the full program
# Chapter 1. p11: what the published post-AI coefficients imply
# Source: Shin, Kim, van Opheusden and Griffiths (2023, PNAS), Table 1.
# Dependent variable: Decision Quality Index (DQI) of each move, in
# percentage points of win rate, DQI = 100 - (AI win rate - human win
# rate), estimated with KataGo (10000 simulated game patterns per
# decision); 5857513 moves, first 60 moves of each game, 1950 to 2021,
# player and move-number fixed effects, standard errors clustered by
# player. Only the coefficients and standard errors below are taken
# from the paper; every derived number is arithmetic on them.
import math
N_OBS = 5857513
PLAYOUTS = 10000
MAX_MOVE = 602
Z = 1.959964
# name: (model 1 estimate, se, model 2 estimate, se)
TABLE = [
("after AI (b1)", 0.59754, 0.01601, None, None),
("novel (b2)", -0.60770, 0.01219, -0.60777, 0.01218),
("after x novel (b3)", 0.51504, 0.02147, 0.51498, 0.02132),
]
def ci(b, se):
return b - Z * se, b + Z * se
if __name__ == "__main__":
print("term est se z 95 % CI")
for name, b, se, b2, se2 in TABLE:
lo, hi = ci(b, se)
print("{:<18} {:9.5f} {:8.5f} {:6.1f} [{:.4f}, {:.4f}]".format(
name, b, se, b / se, lo, hi))
b1, s1 = TABLE[0][1], TABLE[0][2]
b2, s2 = TABLE[1][1], TABLE[1][2]
b3, s3 = TABLE[2][1], TABLE[2][2]
print("model 2 b3 = {:.5f}, se {:.5f}: same to 4 decimals".format(
TABLE[2][3], TABLE[2][4]))
print("cell means relative to pre-AI, non-novel moves (DQI points)")
cells = [("pre-AI non-novel", 0.0), ("pre-AI novel", b2),
("post-AI non-novel", b1),
("post-AI novel", math.fsum([b1, b2, b3]))]
for name, v in cells:
print(" {:<18} {:+.5f}".format(name, v))
gain_novel = math.fsum([b1, b3])
print("AI gain, non-novel moves: {:.5f}".format(b1))
print("AI gain, novel moves: {:.5f} ({:.3f} x)".format(
gain_novel, gain_novel / b1))
print("novelty penalty before: {:.5f}".format(b2))
print("novelty penalty after: {:.5f}".format(math.fsum([b2, b3])))
worst = math.fsum([s1, s3])
print("worst-case se of b1 + b3: {:.5f}, lower 95 % bound {:.4f}".format(
worst, gain_novel - Z * worst))
print("share of b2 penalty removed by b3: {:.3f}".format(-b3 / b2))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 1: The Leap at the Break: a Decision Quality Index on a KataGo Yardstick. 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 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 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