What does Human Go Decisions after AI conclude, in numbers, about “Classics East and West: the Classic of Go in Thirteen Chapters and Franklin's The Morals of Chess”?
Answer: Chapter 7 weighs Zhang Ni's Classic of Go in Thirteen Chapters and Franklin's The Morals of Chess, computing that the break-even point of "rather lose several stones than lose the initiative" falls from 7.00 stones in the opening to 0.79 in the endgame.
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.79, 7.00
| part 1: points on the board 361 | 360 + 1 |
| part 2: stones worth one tempo (T / 2) | |
| move T (points) break-even stones | |
| 0 | 14.00 7.00 |
| 50 | 7.96 3.98 |
| 100 | 4.72 2.36 |
| 150 | 2.99 1.50 |
| 200 | 2.07 1.03 |
| 250 | 1.57 0.79 |
| komi 7.5 is 0.536 of the opening T | |
| part 3: walling off an a x a area | |
| a corner side centre points per stone c / s / m | |
| 3 | 6 9 12 1.50 / 1.00 / 0.75 |
| 4 | 8 12 16 2.00 / 1.33 / 1.00 |
| 5 | 10 15 20 2.50 / 1.67 / 1.25 |
| 6 | 12 18 24 3.00 / 2.00 / 1.50 |
Show the full program
# Chapter 7. p71: three sentences of the Classic in Thirteen Chapters
# turned into numbers
# Part 1: the board of 19 x 19 points and the classic's 360 + 1.
# Part 2: "rather lose several stones than lose the initiative". The
# value of the initiative is taken as the size T of the biggest move
# on the board (illustrative schedule T = 1 + 13 exp(-m / 80) points,
# about 14 at the start, close to twice a komi of 7.5); a captured
# stone costs about 2 points under area scoring, so the break-even
# number of stones is T / 2. Part 3: stones needed to wall off an
# a x a area in a corner, on a side and in the centre of the board,
# counted exactly as empty neighbours on the 19 x 19 grid.
import math
SIZE = 19
KOMI = 7.5
def tempo_value(move):
return 1.0 + 13.0 * math.exp(-move / 80.0)
def wall(a, where):
if where == "corner":
r0, c0 = 0, 0
elif where == "side":
r0, c0 = 0, (SIZE - a) // 2
else:
r0, c0 = (SIZE - a) // 2, (SIZE - a) // 2
inside = {(r, c) for r in range(r0, r0 + a) for c in range(c0, c0 + a)}
border = set()
for r, c in inside:
for dr, dc in ((1, 0), (-1, 0), (0, 1), (0, -1)):
q = (r + dr, c + dc)
if 0 <= q[0] < SIZE and 0 <= q[1] < SIZE and q not in inside:
border.add(q)
return len(border)
if __name__ == "__main__":
print("part 1: points on the board {} = 360 + {}".format(
SIZE * SIZE, SIZE * SIZE - 360))
print("part 2: stones worth one tempo (T / 2)")
print(" move T (points) break-even stones")
for m in (0, 50, 100, 150, 200, 250):
t = tempo_value(m)
print(" {:3d} {:5.2f} {:.2f}".format(m, t, t / 2.0))
print(" komi {} is {:.3f} of the opening T".format(
KOMI, KOMI / tempo_value(0)))
print("part 3: walling off an a x a area")
print(" a corner side centre points per stone c / s / m")
for a in (3, 4, 5, 6):
k = [wall(a, w) for w in ("corner", "side", "centre")]
pts = a * a
print(" {} {:2d} {:2d} {:2d} "
"{:.2f} / {:.2f} / {:.2f}"
.format(a, k[0], k[1], k[2], pts / k[0], pts / k[1],
pts / k[2]))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 7: Classics East and West: the Classic of Go in Thirteen Chapters and Franklin's The Morals of Chess. 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 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 8 · Closing the Loop: a Team Routine for AI Reviews and an Audit of Editorial Decision Quality