关于「主算与客算:七十二局的精确分布与「长短」比较的结构性不对称」,《太乙神数的同余结构与博弈边界》给出的定量结论是什么?

结论:第四章给出主客算在七十二局中的精确分布:主算较长 33 局,客算较长 38 局,各宫位的偏向悬殊;八条读法偏向主方的比例最高达 0.708。

数据口径:书中参数为示意;全部计算由书中程序生成;书中灾异年表为固定种子生成的合成数据。 第六章在合成年表上做随机置换检验,最「显著」的格局族系 p 值为 0.501,计入积年与容差的选择后,至少一条路径名义显著的机会是 0.867。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.708, 33, 38

palace host general guest general (years of 72)
1109
279
368
4512
5139
6115
799
865
956
rules range from 0.250 to 0.708 in host share
ruleyears favouring hostshare
longer count330.458
shorter count380.528
host count >= 10510.708
host odd390.542
same parity270.375
host general > guest370.514
host units > guest units380.528
guest count single180.250
查看完整验算程序
# Chapter 4. p43: generals and a zoo of reading rules. The great general
# is the units digit of a count (10 sets 1, 20 sets 2, 30 sets 3, per
# vol. 2); the deputy is three times the general, mod 10. Each reading
# rule below turns the two counts into "host side favoured or not". The
# rules are this book's list of readings found in later manuals and are
# scored only by how often they favour the host, never by outcome.
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}


RULES = (("longer count", lambda h, g: h > g),
         ("shorter count", lambda h, g: h < g),
         ("host count >= 10", lambda h, g: h >= 10),
         ("host odd", lambda h, g: h % 2 == 1),
         ("same parity", lambda h, g: h % 2 == g % 2),
         ("host general > guest", lambda h, g: general(h) > general(g)),
         ("host units > guest units", lambda h, g: h % 10 > g % 10),
         ("guest count single", lambda h, g: g < 10))


def rate(f):
    return len([j for j in range(72) if f(host(j), guest(j))]) / 72


if __name__ == "__main__":
    hg = Counter(general(host(j)) for j in range(72))
    gg = Counter(general(guest(j)) for j in range(72))
    print(" palace  host general  guest general  (years of 72)")
    for p in range(1, 10):
        print(" {:>6} {:>13} {:>14}".format(p, hg[p], gg[p]))
    print(" rules range from {:.3f} to {:.3f} in host share".format(
        min(rate(f) for n, f in RULES), max(rate(f) for n, f in RULES)))
    print(" rule                       years favouring host  share")
    for name, f in RULES:
        k = len([j for j in range(72) if f(host(j), guest(j))])
        print(" {:<26} {:>20} {:>6.3f}".format(name, k, k / 72))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《太乙神数十六宫游走、积年同余周期与主客算筹博弈边界》第 4 章「主算与客算:七十二局的精确分布与「长短」比较的结构性不对称」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论