关于「方法:交叉飞化、十种互飞格局与流月窗口」,《钦天双人合盘飞化》给出的定量结论是什么?

结论:第一章给出全书的规则与比例:六十四个交叉格每一格都恰好出现在十二分之一的盘对里,即 0.0833,没有一格是稀有的缘分;一个方向平均点亮 5.3333 格。十种互飞格局只看命宫与夫妻宫之间两个方向递了什么,判定规则逐条可执行:单向禄无回占 0.4198,单向忌无回占 0.4142,最多的互入格局禄禄互入也只有 0.0865,十格全不成立的配对占 0.2305。流月窗口按五虎遁的月干判定,每五年重复一次,一对人平均每年有 7.6667 个窗口,至少有一个双方窗口的年份只占 0.0988。第二至第五章逐格写出交叉表的四行,第六章写十种互飞格局,第七章写十二种流月窗口。

数据口径:全部计算由书中程序生成;本书不是婚姻、心理、法律或投资建议。 书中以标注框区分已发表的证据、可运行的 Python 计算、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.0865, 0.2305, 0.4142, 0.4198

ordered pairs: 1866240000; source-stem classes: 20
one direction carries lu: 0.2964
one direction carries quan: 0.2801
one direction carries ke: 0.2848
one direction carries ji: 0.2894
lu-lu mutual0.0865
ji-ji mutual0.0823
lu-ji cross0.1587
quan-quan mutual0.0779
quan-ji cross0.1519
ke-ji cross0.1499
lu-quan cross0.1591
ke-ke mutual0.0801
one-way lu0.4198
one-way ji0.4142
patterns per pair: mean 1.7803
0: 0.2305 1: 0.3054 2: 0.1812 3: 0.1277 4: 0.0873 5: 0.0378 6: 0.0220 7: 0.0064 8: 0.0018
pairs with no Self/Spouse flight either way: 0.0822
查看完整验算程序
# Chapter 1. p03: How often each of the ten mutual patterns occurs over all chart pairs.
# Charts as in p02 (43200 equally weighted cases, a pair = two independent
# charts). Only flights from Self or Spouse stems into the other's Self or
# Spouse palace count. HA = kinds A carries into B, HB = kinds B carries into A.
# Both-way patterns need the kind in HA and HB; a cross pattern needs one kind
# in HA and the other in HB (either way round); one-way needs the kind in
# exactly one of them. A chart enters only through its two source stems and
# the set U of table stars in its Self or Spouse palace, so the 1866240000
# pairs reduce to sums over (source stems, U) classes.
NAYIN = "310231423042104" * 2
BUREAU = {4: 2, 0: 3, 3: 4, 2: 5, 1: 6}
SIHUA = ((5, 13, 3, 2), (1, 11, 0, 7), (4, 1, 14, 5), (7, 4, 1, 9), (8, 7, 17, 1),
         (3, 8, 11, 15), (2, 3, 7, 4), (9, 2, 15, 14), (11, 0, 16, 3), (13, 9, 7, 8))
LU, QUAN, KE, JI = 1, 2, 4, 8
PAT = (("lu-lu mutual", "both", LU, LU), ("ji-ji mutual", "both", JI, JI),
       ("lu-ji cross", "cross", LU, JI), ("quan-quan mutual", "both", QUAN, QUAN),
       ("quan-ji cross", "cross", QUAN, JI), ("ke-ji cross", "cross", KE, JI),
       ("lu-quan cross", "cross", LU, QUAN), ("ke-ke mutual", "both", KE, KE),
       ("one-way lu", "one", LU, LU), ("one-way ji", "one", JI, JI))

def ziwei(day, bu):
    k = 0
    while (day + k) % bu:
        k += 1
    return (2 + (day + k) // bu - 1 + (k if k % 2 == 0 else -k)) % 12

def classes():
    w = {}
    for ys in range(10):
        for m in range(1, 13):
            for h in range(12):
                ming = (1 + m - h) % 12
                stem = lambda b: ((ys % 5 * 2 + 2) + (b - 2) % 12) % 10
                bu = BUREAU[int(NAYIN[((6 * stem(ming) - 5 * ming) % 60) // 2])]
                for d in range(1, 31):
                    z = ziwei(d, bu)
                    tf = (4 - z) % 12
                    pos = [z, z - 1, z - 3, z - 4, z - 5, z - 8, tf, tf + 1, tf + 2, tf + 3,
                           tf + 4, tf + 5, tf + 6, tf + 10, 10 - h, 4 + h, 3 + m, 11 - m]
                    u = sum(1 << i for i, b in enumerate(pos) if (ming - b) % 12 in (0, 2))
                    key = ((stem(ming), stem(ming - 2)), u)
                    w[key] = w.get(key, 0) + 1
    return w

def carried(src, u):
    x = 0
    for s in src:
        for k in range(4):
            if u >> SIHUA[s][k] & 1:
                x |= 1 << k
    return x

def holds(kind, a, b, x, y):
    if kind == "both":
        return x & a and y & a
    if kind == "cross":
        return (x & a and y & b) or (x & b and y & a)
    return bool(x & a) != bool(y & a)

if __name__ == "__main__":
    w = classes()
    srcs = sorted({s for s, u in w})
    G = {(a, b): [0] * 16 for a in srcs for b in srcs}
    for (s1, u), n in w.items():
        for s2 in srcs:
            G[(s1, s2)][carried(s2, u)] += n
    joint = [[0] * 16 for _ in range(16)]
    for a in srcs:
        for b in srcs:
            for x in range(16):
                if G[(b, a)][x]:
                    for y in range(16):
                        joint[x][y] += G[(b, a)][x] * G[(a, b)][y]
    tot = sum(map(sum, joint))
    print("   ordered pairs: {}; source-stem classes: {}".format(tot, len(srcs)))
    for nm, bit in (("lu", LU), ("quan", QUAN), ("ke", KE), ("ji", JI)):
        print("   one direction carries {:<4}: {:.4f}".format(nm, sum(
            joint[x][y] for x in range(16) for y in range(16) if x & bit) / tot))
    cnt = [0] * 11
    for i, (nm, kind, a, b) in enumerate(PAT):
        s = sum(joint[x][y] for x in range(16) for y in range(16) if holds(kind, a, b, x, y))
        print("   {:<17} {:.4f}".format(nm, s / tot))
    for x in range(16):
        for y in range(16):
            cnt[sum(1 for nm, kind, a, b in PAT if holds(kind, a, b, x, y))] += joint[x][y]
    print("   patterns per pair: mean {:.4f}".format(sum(i * c for i, c in enumerate(cnt)) / tot))
    print("   " + "  ".join("{}: {:.4f}".format(i, c / tot) for i, c in enumerate(cnt) if c))
    print("   pairs with no Self/Spouse flight either way: {:.4f}".format(joint[0][0] / tot))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《钦天双人合盘与宿命情缘飞化母典》第 1 章「方法:交叉飞化、十种互飞格局与流月窗口」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026120,
  author    = {Fan, Yafu},
  title     = {The Qintian Synastry Codex of Cross-Flying Transformations},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论