关于「命宫出手:你这个人落进对方盘里的十六种方式」,《钦天双人合盘飞化》给出的定量结论是什么?

结论:本章写完了 A 命宫一行的十六格:禄四格读你这个人白给的引力落在对方哪里,权四格读你在对方哪里掌舵,科四格读你给对方的体面,忌四格读你在对方身上欠下、也讨着的债。精确计算表明,十六格每一格都恰好是十二分之一(0.0833),没有哪一格是稀有的缘分;稀有的是叠加:四化全落进对方四宫只有 0.0039,禄忌落进对方同一宫只有 0.0111。至少亮一格的盘对占 0.8361,所以「有交叉」本身不说明任何事。这些读法都是诠释;本章给出了两项可以预先登记的检验与所需样本量。

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

English version

对照数据表

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

combinations (stem x chart B)432000
number of A's four transformations landing in B's four palaces:
0 lit0.1639
1 lit0.4181
2 lit0.3428
3 lit0.0713
4 lit0.0039
at least one lit0.8361
lu and ji both lit0.0972
ji lit, lu not lit0.2361
lu lit, ji not lit0.2361
two or more stacked in one of B's four0.1161
lu and ji stacked in one of B's four0.0111
stems that can stack lu and ji: Ji, Xin, Yi
B palace receives at least one transformation:
Self0.3035
Spouse0.3035
Children0.3035
Property0.3035
查看完整验算程序
# Chapter 2. p11: How many of the four transformations of A's Self stem land in B's four palaces.
# Method: A's Self-palace stem is uniform over the ten stems (p10: 4320 cases each), so a random
# pair is a uniform stem crossed with the 43200 cases of chart B (same arithmetic as p10). For
# each of the 432000 equally weighted combinations we take the four stars the stem transforms
# (lu, quan, ke, ji), look up the palace of B in which each sits, and count how many land in
# Self, Spouse, Children or Property. We also record stacks: two transformations in one palace.
from collections import Counter
NAYIN = "310231423042104" * 2
BUREAU = {4: 2, 0: 3, 3: 4, 2: 5, 1: 6}
SIHUA = [["LianZhen", "PoJun", "WuQu", "TaiYang"], ["TianJi", "TianLiang", "ZiWei", "TaiYin"],
         ["TianTong", "TianJi", "WenChang", "LianZhen"], ["TaiYin", "TianTong", "TianJi", "JuMen"],
         ["TanLang", "TaiYin", "YouBi", "TianJi"], ["WuQu", "TanLang", "TianLiang", "WenQu"],
         ["TaiYang", "WuQu", "TaiYin", "TianTong"], ["JuMen", "TaiYang", "WenQu", "WenChang"],
         ["TianLiang", "ZiWei", "ZuoFu", "WuQu"], ["PoJun", "JuMen", "TaiYin", "TanLang"]]
HUA = ["lu", "quan", "ke", "ji"]
TARGET = {0: "Self", 2: "Spouse", 3: "Children", 9: "Property"}

def charts():
    for ys in range(10):
        y0 = (ys % 5 * 2 + 2) % 10
        for month in range(1, 13):
            for hour in range(12):
                ming = (2 + month - 1 - hour) % 12
                st = (y0 + (ming - 2) % 12) % 10
                bu = BUREAU[int(NAYIN[((6 * st - 5 * ming) % 60) // 2])]
                for day in range(1, 31):
                    k = 0
                    while (day + k) % bu:
                        k += 1
                    zw = (2 + (day + k) // bu - 1 + (k if k % 2 == 0 else -k)) % 12
                    tf = (4 - zw) % 12
                    pos = {"ZiWei": zw, "TianJi": zw - 1, "TaiYang": zw - 3, "WuQu": zw - 4,
                           "TianTong": zw - 5, "LianZhen": zw - 8, "TaiYin": tf + 1, "TanLang": tf + 2,
                           "JuMen": tf + 3, "TianLiang": tf + 5, "PoJun": tf + 10, "WenChang": 10 - hour,
                           "WenQu": 4 + hour, "ZuoFu": 4 + month - 1, "YouBi": 10 - (month - 1)}
                    yield y0, ming, {s: (ming - b) % 12 for s, b in pos.items()}

STEM = ["Jia", "Yi", "Bing", "Ding", "Wu", "Ji", "Geng", "Xin", "Ren", "Gui"]

if __name__ == "__main__":
    B = list(charts())
    four = set(TARGET)
    lit_n, ev, luji_stem, recv = Counter(), Counter(), Counter(), Counter()
    total = 0
    for s in range(10):
        for _, _, pal in B:
            total += 1
            ps = [pal[SIHUA[s][h]] for h in range(4)]
            lit = [p for p in ps if p in four]
            lit_n[len(lit)] += 1
            for x in set(lit):
                recv[x] += 1
            lu, ji = ps[0] in four, ps[3] in four
            ev["lu and ji both lit"] += lu and ji
            ev["ji lit, lu not lit"] += ji and not lu
            ev["lu lit, ji not lit"] += lu and not ji
            ev["two or more stacked in one of B's four"] += len(lit) != len(set(lit))
            if lu and ps[0] == ps[3]:
                ev["lu and ji stacked in one of B's four"] += 1
                luji_stem[STEM[s]] += 1
    print("   combinations (stem x chart B): {}".format(total))
    print("   number of A's four transformations landing in B's four palaces:")
    for k in range(5):
        print("     {} lit: {:.4f}".format(k, lit_n[k] / total))
    print("   at least one lit: {:.4f}".format(1 - lit_n[0] / total))
    for name in ev:
        print("   {}: {:.4f}".format(name, ev[name] / total))
    print("   stems that can stack lu and ji: {}".format(", ".join(sorted(luji_stem))))
    print("   B palace receives at least one transformation:")
    for x in TARGET:
        print("     {:9s} {:.4f}".format(TARGET[x], recv[x] / total))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《钦天双人合盘与宿命情缘飞化母典》第 2 章「命宫出手:你这个人落进对方盘里的十六种方式」(版本 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}
}

本书其他章节结论