What does Human Go Decisions after AI conclude, in numbers, about “Novel-Move Rates: the First Historically New Move, a Growing Database and the Memorisation Test”?

Answer: Chapter 3 shows that the Novelty Index drifts mechanically as the historical database grows and tests the inserted-AI-games check against memorisation: copying particular games is fully exposed, but learning the AI's opening distribution keeps 0.860 of the gain.

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

mean NI of human games 2017 to 2021
no AI influence at all: 592.16
worldwithout insertwith insertchangegain kept
C592.59590.13-2.460.000
M594.59594.25-0.340.860
I594.60594.58-0.020.991
Show the full program
# Chapter 3. p33: the inserted-AI-games test for memorised novelty
# Model (illustrative, built on p32): from 2017 the AI-influenced human
# games either replay the first 12 moves of one of the AI's own games
# (world C, copying lines), or draw from the AI's opening distribution
# (world M, rotation 3, s = 1.6, the law AI-vs-AI games follow), or
# explore a region of their own (world I: rotation 6, s = 1.6).
# The test of Shin et al. (2023) is mimicked: 600 AI-vs-AI games are
# inserted into the history at the end of 2016, then the Novelty Index
# of human games in 2017 to 2021 is recomputed. Memorised novelty
# should mostly vanish; self-made novelty should survive. Seeded.
import bisect
import math
import random
import statistics

SEED = 20261112
DEPTH = 30
CANDS = 10
S_HUMAN = 2.2
S_AI = 1.6
AI_ROT = 3
INSERTED = 600
MAX_MOVE = 602


def cumulative(s):
    w = [1.0 / (i + 1) ** s for i in range(CANDS)]
    total = math.fsum(w)
    return [math.fsum(w[:k + 1]) / total for k in range(CANDS)]


def pick(rng, cum):
    return min(bisect.bisect_left(cum, rng.random()), CANDS - 1)


def play(rng, cum_h, cum_ai, rot):
    seq = []
    for k in range(DEPTH):
        if rot and k >= 2:
            seq.append((pick(rng, cum_ai) + rot) % CANDS)
        else:
            seq.append(pick(rng, cum_h))
    return tuple(seq)


def novel_move(seq, seen):
    first = None
    for k in range(1, DEPTH + 1):
        p = seq[:k]
        if first is None and p not in seen:
            first = k
        seen.add(p)
    return first if first is not None else DEPTH + 1


def share(year):
    return {2017: 0.3, 2018: 0.5}.get(year, 0.7 if year >= 2019 else 0.0)


def post_ai_ni(human_rot, insert):
    rng = random.Random(20261112)
    ins_rng = random.Random(20261113)
    cum_h, cum_ai = cumulative(S_HUMAN), cumulative(S_AI)
    ai_games = [play(ins_rng, cum_h, cum_ai, AI_ROT)
                for _ in range(INSERTED)]
    seen, post = set(), []
    for year in range(1980, 2022):
        if year == 2017 and insert:
            for g in ai_games:
                novel_move(g, seen)
        for _ in range(60 + 6 * (year - 1980)):
            rot = human_rot if rng.random() < share(year) else 0
            seq = play(rng, cum_h, cum_ai, rot % CANDS)
            if rot == CANDS:
                seq = ai_games[rng.randrange(INSERTED)][:12] + seq[12:]
            m = novel_move(seq, seen)
            if year >= 2017:
                post.append(MAX_MOVE - m)
    return statistics.fmean(post)


if __name__ == "__main__":
    base = post_ai_ni(0, False)
    print("mean NI of human games 2017 to 2021")
    print("no AI influence at all: {:.2f}".format(base))
    print("world   without insert   with insert   change   gain kept")
    for name, rot in (("C", CANDS), ("M", AI_ROT), ("I", 6)):
        a = post_ai_ni(rot, False)
        b = post_ai_ni(rot, True)
        kept = max(0.0, b - base) / (a - base)
        print("  {}        {:.2f}          {:.2f}      {:+.2f}     {:.3f}"
              .format(name, a, b, b - a, kept))

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 3: Novel-Move Rates: the First Historically New Move, a Growing Database and the Memorisation Test. 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