关于「丙丁:太阳与灯烛的二十四种气候张力」,《子平调候与十神博弈》给出的定量结论是什么?

结论:丙是太阳,要一片湖;丁是灯烛,要柴也要斧。p15 显示,丙火十二格的调候用神里七杀(壬)出现 12 次,丁火十二格里正财(庚)出现 12 次、正印(甲)11 次,两个日干都只有 2 个月份的第一钥匙本来就藏在月令里。p16 在每格 4320 个等权的盘中数出:第一钥匙出现率平均为 0.6398(丙)与 0.6528(丁),丙未有 0.2836 的盘一把钥匙也没有,另有八格全缺的比例是 0.0000。二十四格的阳面、阴面、钱、契约、关系与杠杆,都是从「谁来做那片湖」「谁来供柴劈柴」这两个问题推出来的诠释,p17 给出了检验它们的办法:300 人,88 次命中。

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

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.0000, 0.2836, 0.6398, 0.6528, 4320

charts per cell: 4320
cellkeysshown1pres1pres2none
Bing-YinRen Geng0.26670.58330.63540.1782
Bing-MaoRen Ji0.17500.53120.70370.1167
Bing-ChenRen Jia0.35830.63540.63540.1491
Bing-SiRen Geng Gui0.17500.53121.00000.0000
Bing-WuRen Geng0.35830.63540.63540.1782
Bing-WeiRen Geng0.17500.53120.53120.2836
Bing-ShenRen Wu0.35831.00001.00000.0000
Bing-YouRen Gui0.17500.53120.77040.0875
Bing-XuJia Ren0.26670.58330.63540.1491
Bing-HaiJia Wu Geng Ren0.17501.00000.90830.0000
Bing-ZiRen Wu Ji0.26670.58330.92780.0028
Bing-ChouRen Jia0.17500.53120.53120.2398
Bing mean share with the first key present: 0.6398
Ding-YinJia Geng0.35831.00000.67590.0000
Ding-MaoGeng Jia0.25000.58330.53120.1481
Ding-ChenJia Geng0.35830.63540.62960.0926
Ding-SiJia Geng0.17500.53121.00000.0000
Ding-WuRen Geng Gui0.35830.63540.67590.0250
Ding-WeiJia Ren Geng0.17500.53120.53120.1296
Ding-ShenJia Geng Bing Wu0.35830.63541.00000.0000
Ding-YouJia Geng Bing Wu0.17500.53120.58330.0815
Ding-XuJia Geng Wu0.26670.58330.67590.0000
Ding-HaiJia Geng0.17501.00000.58330.0000
Ding-ZiJia Geng0.35830.63540.67590.0741
Ding-ChouJia Geng0.17500.53120.58330.1481
Ding mean share with the first key present: 0.6528
查看完整验算程序
# Chapter 3. p16: How often the climate keys of a Bing or Ding cell are
# actually present in a chart, by exact calendar enumeration.
# Method: fix the day stem (Bing or Ding) and the month branch. Then run
# over all 60 year pillars, the 6 day pillars carrying that day stem and
# the 12 hours: 60 x 6 x 12 = 4320 equally weighted charts per cell. The
# month stem follows from the year stem (five-tiger rule), the hour stem
# from the day stem (five-rat rule). A key counts as "shown" when it is a
# visible stem of the year, month or hour pillar, and "present" when it
# is shown or hides in any of the four branches (house engine rule).
# Columns: first key shown, first key present, second key present, no
# key present at all. Equal weights stand in for the real calendar.
STEMS = ["Jia", "Yi", "Bing", "Ding", "Wu", "Ji", "Geng", "Xin", "Ren", "Gui"]
BR = ["Zi", "Chou", "Yin", "Mao", "Chen", "Si", "Wu", "Wei", "Shen", "You",
      "Xu", "Hai"]
HIDDEN = [[9], [5, 9, 7], [0, 2, 4], [1], [4, 1, 9], [2, 6, 4], [3, 5],
          [5, 3, 1], [6, 8, 4], [7], [4, 7, 3], [8, 0]]
ORDER = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1]          # Yin .. Chou
KEYS = {2: {2: "86", 3: "85", 4: "80", 5: "869", 6: "86", 7: "86", 8: "84",
            9: "89", 10: "08", 11: "0468", 0: "845", 1: "80"},
        3: {2: "06", 3: "60", 4: "06", 5: "06", 6: "869", 7: "086",
            8: "0624", 9: "0624", 10: "064", 11: "06", 0: "06", 1: "06"}}

def charts(ds, mb):
    for y in range(60):
        ys, yb = y % 10, y % 12
        ms = ((ys % 5) * 2 + 2 + (mb - 2) % 12) % 10
        for db in range(ds % 2, 12, 2):
            for hb in range(12):
                hs = ((ds % 5) * 2 + hb) % 10
                yield [ys, ms, hs], [yb, mb, db, hb]

def cell(ds, mb):
    keys = [int(c) for c in KEYS[ds][mb]]
    n = shown1 = pres1 = pres2 = none = 0
    for stems, branches in charts(ds, mb):
        n += 1
        allst = set(stems)
        for b in branches:
            allst.update(HIDDEN[b])
        shown1 += keys[0] in stems
        pres1 += keys[0] in allst
        pres2 += len(keys) > 1 and keys[1] in allst
        none += not any(k in allst for k in keys)
    return keys, n, shown1 / n, pres1 / n, pres2 / n, none / n

if __name__ == "__main__":
    print("   charts per cell: {}".format(sum(1 for _ in charts(2, 2))))
    print("   cell       keys              shown1  pres1   pres2   none")
    for ds in (2, 3):
        avg = 0.0
        for mb in ORDER:
            keys, n, s1, p1, p2, no = cell(ds, mb)
            avg += p1 / 12
            print("   {:4s}-{:4s}  {:16s}  {:.4f}  {:.4f}  {:.4f}  {:.4f}".format(
                STEMS[ds], BR[mb], " ".join(STEMS[k] for k in keys),
                s1, p1, p2, no))
        print("   {} mean share with the first key present: {:.4f}".format(
            STEMS[ds], avg))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《子平调候张力与十神人性博弈母典》第 3 章「丙丁:太阳与灯烛的二十四种气候张力」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026119,
  author    = {Fan, Yafu},
  title     = {The Ziping Climate-Tension and Ten-Gods Codex of Human Games},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论