关于「四课:日干寄宫、六十甲子与课体计数」,《大六壬的群作用与九宗门代数》给出的定量结论是什么?

结论:六十甲子是直积中阶为 60 的循环子群,干支奇偶永远一致。寄宫表把十个天干映到八个宫位,完全避开四仲。四课由寄宫、日支与步长三者决定;寄宫与日支的距离在 0 到 11 上均匀分布,每个距离 5 日。720 类局面中,四课齐全 500 类,不备 100 类,两课 115 类,一课 5 类。贼克的比例随步长从 0.025 变到 0.392,这个起伏决定了下一章各法门的分布。

数据口径:书中关于用户、档案与价格的参数均为示意;全部计算由书中程序生成;本书分析体系的结构与概率,不做任何个人占断,也不是法律、财务或经营建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(19 段程序)、原典与作者的假说。

English version

对照数据表

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

sslots zeislots kedays anydays 2+ canddistinct lessons
00.0250.0251202:55 1:5
10.1330.1084374:45 3:10 2:5
20.2250.13351114:45 3:10 2:5
30.1580.0253644:45 3:10 2:5
40.2750.15856194:45 3:10 2:5
50.3670.34259324:45 3:10 2:5
60.3420.29254224:50 2:10
70.3170.39260324:45 3:10 2:5
80.1330.25054204:45 3:10 2:5
90.0250.1834064:45 3:10 2:5
100.1330.22548134:45 3:10 2:5
110.1330.15847134:45 3:10 2:5
all 720: four distinct 500 | three 100 | two 115 | one 5
a random ordered element pair is zei with prob 0.2
查看完整验算程序
# Chapter 2. p22: The four lessons over all 60 days x 12 shifts.
# Model: lesson 1 = (palace + s over the day stem), lesson 2 = (its upper
# + s over it), lesson 3 = (branch + s over the day branch), lesson 4 =
# (its upper + s over it). "zei" = lower overcomes upper, "ke" = upper
# overcomes lower. Exact enumeration of the 720 classes; each class
# stands for 12 (general, hour) pairs. Rules: standard Liu Ren.
import math
from collections import Counter

B = ("zi", "chou", "yin", "mao", "chen", "si", "wu", "wei", "shen",
     "you", "xu", "hai")
G = ("jia", "yi", "bing", "ding", "wu", "ji", "geng", "xin", "ren", "gui")
BE = (4, 2, 0, 0, 2, 1, 1, 2, 3, 3, 2, 4)  # 0 wood 1 fire 2 earth
GE = (0, 0, 1, 1, 2, 2, 3, 3, 4, 4)        # 3 metal 4 water
GONG = (2, 4, 5, 7, 5, 7, 8, 10, 11, 1)    # lodging palace of each stem
XING = (3, 10, 5, 0, 4, 8, 6, 1, 2, 9, 7, 11)   # punishment map


def ke(a, b):
    """True if element a overcomes element b."""
    return (b - a) % 5 == 2


def uniq(xs):
    out = []
    for x in xs:
        if x not in out:
            out.append(x)
    return out


def depth(u, s, kind, cnt="A", home=True):
    """She-hai depth of upper u walking home from ground (u - s)."""
    n = 0
    for i in range(s + 1 if home else s):
        q = (u - s + i) % 12
        for e in [BE[q]] + [GE[g] for g in range(10) if GONG[g] == q]:
            if cnt == "B" and kind == "ke":
                n += ke(BE[u], e)
            else:
                n += ke(e, BE[u])
    return n


def pick(pool, k, s, kind, v):
    g = k % 10
    if len(pool) == 1:
        return pool[0], "one"
    bi = [u for u in pool if u % 2 == g % 2]
    if len(bi) == 1:
        return bi[0], "biyong"
    pool = bi or pool
    tied = pool
    if v.get("mode", "depth") == "depth":
        ds = [depth(u, s, kind, v.get("cnt", "A"), v.get("home", True))
              for u in pool]
        tied = [u for u, d in zip(pool, ds) if d == max(ds)]
        if len(tied) == 1:
            return tied[0], "depth"
    for lab, r in (("jianji", 2), ("chawei", 0)):
        on = [u for u in tied if (u - s) % 12 % 3 == r]
        if len(on) == 1:
            return on[0], lab
        if on:
            break
    z = GONG[g] if g % 2 == 0 else k % 12
    return (z + s) % 12, "zhuixia"


def lessons(k, s):
    a = (GONG[k % 10] + s) % 12
    c = (k % 12 + s) % 12
    return a, (a + s) % 12, c, (c + s) % 12


def sanchuan(k, s, v=None):
    """(initial, middle, final, gate, how) for day k and shift s."""
    v = v or {}
    g, z = k % 10, k % 12
    yang = g % 2 == 0
    a, b, c, d = lessons(k, s)
    low = ((a, GE[g]), (b, BE[a]), (c, BE[z]), (d, BE[c]))
    zei = uniq([u for u, e in low if ke(e, BE[u])])
    kk = uniq([u for u, e in low if ke(BE[u], e)])
    if s == 0:
        gan = bool(zei or kk) or yang
        x = a if gan else c
        y = (c if gan else a) if XING[x] == x else XING[x]
        w = (y + 6) % 12 if XING[y] == y else XING[y]
        how = "withke" if zei or kk else ("yangday" if yang else "yinday")
        return x, y, w, "fuyin", how
    if zei or kk:
        x, how = pick(zei or kk, k, s, "zei" if zei else "ke", v)
        if how == "one":
            how = "chongshen" if zei else "yuanshou"
        gate = {"chongshen": "zeike", "yuanshou": "zeike",
                "biyong": "biyong"}.get(how, "shehai")
        if s == 6:
            gate = "fanyin"
        return x, (x + s) % 12, (x + 2 * s) % 12, gate, how
    if s == 6:
        sheng = [t % 12 for t in (z, z + 4, z + 8) if t % 3 == 2][0]
        return (sheng + 6) % 12, c, a, "fanyin", "jinglan"
    ups = uniq([b, c, d])
    p1 = [u for u in ups if ke(BE[u], GE[g])]
    p2 = [u for u in ups if ke(GE[g], BE[u])]
    same = GONG[g] == z
    if (p1 or p2) and not (same and v.get("bz_first")):
        x, _ = pick(p1 or p2, k, s, "ke", v)
        how = "haoshi" if p1 else "danshe"
        return x, (x + s) % 12, (x + 2 * s) % 12, "yaoke", how
    if same:
        x = (a + 2) % 12 if yang else (d - 2) % 12
        return x, a, a, "bazhuan", "bazhuan"
    if len({(a, GONG[g]), (b, a), (c, z), (d, c)}) < 4:
        x = (GONG[(g + 5) % 10] + s) % 12 if yang else (z + 4) % 12
        return x, a, a, "bieze", "bieze"
    if yang:
        return (9 + s) % 12, c, a, "maoxing", "mao-yang"
    return (9 - s) % 12, a, c, "maoxing", "mao-yin"


def relations(k, s):
    g, z = k % 10, k % 12
    a, b, c, d = lessons(k, s)
    low = ((a, GE[g]), (b, BE[a]), (c, BE[z]), (d, BE[c]))
    zei = uniq([u for u, e in low if ke(e, BE[u])])
    kk = uniq([u for u, e in low if ke(BE[u], e)])
    n = len({(a, GONG[g]), (b, a), (c, z), (d, c)})
    return zei, kk, n


print(" s  slots zei  slots ke  days any  days 2+ cand  distinct lessons")
tot = Counter()
for s in range(12):
    nz = nk = anyk = multi = 0
    dist = Counter()
    for k in range(60):
        g, z = k % 10, k % 12
        a, b, c, d = lessons(k, s)
        low = ((a, GE[g]), (b, BE[a]), (c, BE[z]), (d, BE[c]))
        nz += len([1 for u, e in low if ke(e, BE[u])])
        nk += len([1 for u, e in low if ke(BE[u], e)])
        zei, kk, n = relations(k, s)
        anyk += bool(zei or kk)
        multi += len(zei or kk) > 1
        dist[n] += 1
        tot[n] += 1
    print("{:2d}  {:9.3f}  {:8.3f}  {:8d}  {:12d}  {}".format(
        s, nz / 240, nk / 240, anyk, multi,
        " ".join("{}:{}".format(m, dist[m]) for m in (4, 3, 2, 1)
                 if dist[m])))
print("all 720: four distinct", tot[4], "| three", tot[3], "| two",
      tot[2], "| one", tot[1])
print("a random ordered element pair is zei with prob", 5 / 25)

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《大六壬天地盘置换、四课三传有向图与九宗门涉害深度代数》第 2 章「四课:日干寄宫、六十甲子与课体计数」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-153 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026153,
  author    = {Fan, Yafu},
  title     = {Da Liu Ren Heaven-Earth Plate Permutations, Four-Lesson Three-Transmission Digraphs and the Depth Algebra of the Nine Methods},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论