What does Taiyi Congruence Cycles and Game Bounds conclude, in numbers, about “A Deterministic Walk on the Ring of Sixteen Gods: Occupancy and the True Base Rate of "Rare" Configurations”?

Answer: Chapter 2 enumerates the ring of sixteen gods and finds that six common configurations together fill 0.681 of the seventy-two years.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; its chronicle of calamities is synthetic data generated with a fixed seed. Chapter 6 runs random-permutation tests on a synthetic chronicle: the most "significant" configuration has a family-wise p of 0.501, and once the choice of convention and tolerance is counted, the chance that some path is nominally significant is 0.867.

中文版

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

patternyears of 72share
yan40.056
po170.236
ji180.250
qiu230.319
guan20.028
ge80.111
years with at least one pattern: 49 of 72 = 0.681
years by number of patterns: 0:23, 1:31, 2:13, 3:5
longest run of years with no pattern: 5
Show the full program
# Chapter 2. p22: how often the named configurations occur in one exact
# 72-year cycle. Yan follows the Jinjing (vol. 3): Shiji on the Taiyi
# palace. The others are this book's operational encodings: po, Wenchang
# within two slots of Taiyi; ji, Shiji within two slots; qiu, a host or
# guest general in the Taiyi palace; guan, the two generals together;
# ge, the guest general opposite Taiyi (palace sum 10).
from collections import Counter

# Ring of sixteen gods, clockwise from zi; ring slots that are palaces
# carry the Taiyi palace number (Jinjing vol. 2 example: from Dayi (hai)
# 1, Dizhu (zi) 8, Hede (gen) 3, Gaocong (mao) 4, total 16 before xun 9).
RING = ("zi", "chou", "gen", "yin", "mao", "chen", "xun", "si",
        "wu", "wei", "kun", "shen", "you", "xu", "qian", "hai")
PAL = {0: 8, 2: 3, 4: 4, 6: 9, 8: 2, 10: 7, 12: 6, 14: 1}
POS = {p: k for k, p in PAL.items()}
TY_ORDER = (1, 2, 3, 4, 6, 7, 8, 9)          # skips the centre 5
# Wenchang starts at Wude (shen) and walks clockwise; qian and kun each
# hold it two years, so one circuit of 16 gods takes 18 years.
WC_SEQ = (11, 12, 13, 14, 14, 15, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10)
BR_POS = (0, 1, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15)   # 12 branches on ring


def taiyi(j):
    r = j % 360 % 72 % 24 or 24
    return TY_ORDER[(r - 1) // 3]


def wenchang(j):
    r = j % 360 % 72 % 18 or 18
    return WC_SEQ[r - 1]


def jishen(j):
    r = j % 60 or 60                     # from yin, counter-clockwise
    return BR_POS[(2 - (r - 1)) % 12]


def shiji(j):
    # Jishen laid on Hede (gen, slot 2); read where Wenchang falls
    return (wenchang(j) + 2 - jishen(j)) % 16


def count(start, ty):
    stop = POS[ty]
    k, tot = start, PAL.get(start, 1)
    if k == stop:
        return tot
    k = (k + 1) % 16
    while k != stop:
        tot += PAL.get(k, 0)
        k = (k + 1) % 16
    return tot


def host(j):
    return count(wenchang(j), taiyi(j))


def guest(j):
    return count(shiji(j), taiyi(j))


def general(s):
    # counts reduce by their units: 24 sets 4; 10 sets 1 (vol. 2)
    r = s % 10
    return r if r else (s // 10) % 10 or 1


def patterns(j):
    t = POS[taiyi(j)]
    w, g = wenchang(j), shiji(j)
    hg, gg = general(host(j)), general(guest(j))

    def near(a):
        return min((a - t) % 16, (t - a) % 16) in (1, 2)
    return {"yan": g == t, "po": near(w), "ji": near(g),
            "qiu": taiyi(j) in (hg, gg), "guan": hg == gg,
            "ge": gg + taiyi(j) == 10}


if __name__ == "__main__":
    names = ("yan", "po", "ji", "qiu", "guan", "ge")
    tally = Counter()
    any_n, nhits = 0, Counter()
    for j in range(72):
        p = patterns(j)
        k = 0
        for n in names:
            if p[n]:
                tally[n] += 1
                k += 1
        nhits[k] += 1
        any_n += k > 0
    print(" pattern  years of 72  share")
    for n in names:
        print(" {:<7} {:>11}  {:.3f}".format(n, tally[n], tally[n] / 72))
    print(" years with at least one pattern: {} of 72 = {:.3f}".format(
        any_n, any_n / 72))
    print(" years by number of patterns: " + ", ".join(
        "{}:{}".format(k, nhits[k]) for k in sorted(nhits)))
    win = [j for j in range(72) if any(patterns(j).values())]
    gaps = [b - a for a, b in zip(win, win[1:] + [win[0] + 72])]
    print(" longest run of years with no pattern: {}".format(
        max(gaps) - 1))

Single source and citation

Fan, Y. (2026). Taiyi Shenshu: Sixteen-Palace Walks, Accumulated-Year Congruence Cycles and the Game Bounds of Host and Guest Counting Rods (Version 1.0.0), Chapter 2: A Deterministic Walk on the Ring of Sixteen Gods: Occupancy and the True Base Rate of "Rare" Configurations. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-154 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026154,
  author    = {Fan, Yafu},
  title     = {Taiyi Shenshu: Sixteen-Palace Walks, Accumulated-Year Congruence Cycles and the Game Bounds of Host and Guest Counting Rods},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book