关于「十神与二十四组合:谁在盘里说话,谁和谁结伴」,《子平调候与十神博弈》给出的定量结论是什么?

结论:按 80 点的计数规则,十个十神主导的机会几乎均等,最多的食神 0.1078,最少的正印 0.0942,主导十神等于月支本气的只有 0.5278。二十四种组合写成算术之后,平均每盘成立 1.2074 种,0.7880 的盘至少成立一种,最常见的是官印相生,最稀有的专旺格只有 0.0012。276 对组合里 138 对从不同时成立,最常结伴的是官杀混杂与官印相生。样盘 A 由七杀主导,成立身杀两停与羊刃驾杀。每一种主导与组合都写成了六段:结构、阳面气场、阴面软肋、钱怎么来、契约盲区、关系潜台词;它们是规则的读法,不是已经验证的预测,检验的方法写在上面的假说框里。

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

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.0942, 0.1078, 0.5278, 80

charts: 518400(80 points each)
EatingGod558660.1078
Friend538940.1040
IndRes531430.1025
SevenKill528040.1019
HurtOfficer524710.1012
IndWealth523830.1010
RobWealth505630.0975
DirWealth492240.0950
DirOfficer492220.0949
DirRes488300.0942
same-polarity gods dominate: 0.5171
dominant god = month branch main-qi god: 0.5278
self points S: below 25 0.2999, 25 to 39 0.4118, 40 or more 0.2883
查看完整验算程序
# Chapter 7. p35: How often each ten god dominates a chart, under the
# chapter's point rule, over the formal calendar enumeration.
# Method: every year pillar (60) x month (12; month stem by the five-tiger
# rule) x day pillar (60) x hour (12; hour stem by the five-rat rule),
# 518400 equally weighted charts. Hidden stems: house engine table.
# Points: each visible stem (year, month, hour) 10; each branch 10 split
# over its hidden stems (one 10; two 7/3; three 6/3/1), the month branch
# doubled; 80 points per chart, the day stem itself not counted. Groups:
# B peers, O output, W wealth, K officer+kill, R seal; S = B + R. The
# dominant god has the most points (tie: the month branch main-qi god,
# else list order). The 24 combination tests are in combos(), one line
# each, in the order of the chapter.
STEMS = ["Jia", "Yi", "Bing", "Ding", "Wu", "Ji", "Geng", "Xin", "Ren", "Gui"]
HID = ["9", "597", "024", "1", "419", "264", "35", "531", "684", "7", "473", "80"]
SPLIT = {1: [10], 2: [7, 3], 3: [6, 3, 1]}   # points per hidden stem
REN = {0: 3, 2: 6, 4: 6, 6: 9, 8: 0}          # yang day stem -> blade branch
HUA = {(0, 5): 2, (1, 6): 3, (2, 7): 4, (3, 8): 0, (4, 9): 1}
GODS = ["Friend", "RobWealth", "EatingGod", "HurtOfficer", "IndWealth",
        "DirWealth", "SevenKill", "DirOfficer", "IndRes", "DirRes"]
COMBOS = ["HurtMeetsOfficer", "HurtWithSeal", "FoodTamesKill", "KillSealFlow",
          "WealthHeavySelfLight", "RivalsTakeWealth", "OwlTakesFood",
          "OfficerKillMixed", "WealthOfficerPair", "OutputFeedsWealth",
          "SelfKillBalanced", "WealthFeedsWeakKill", "BladeRidesKill",
          "SealHeavySelfLight", "WealthBreaksSeal", "OfficerSealFlow",
          "FoodFeedsWealth", "HurtFeedsWealth", "PeersPropSelf",
          "FollowWealth", "FollowKill", "FollowOutput", "SoleDominant",
          "Transform"]

def god(d, o):
    return 2 * ((o // 2 - d // 2) % 5) + (d % 2 != o % 2)

def points(ds, stems, branches):
    v = [0] * 10
    for s in stems:
        v[god(ds, s)] += 10
    for k, b in enumerate(branches):
        for s, w in zip(HID[b], SPLIT[len(HID[b])]):
            v[god(ds, int(s))] += w * (2 if k == 1 else 1)
    return v

def dominant(ds, v, mb):
    g = god(ds, int(HID[mb][0]))
    return g if v[g] == max(v) else v.index(max(v))

def combos(ds, v, stems, branches):
    B, O, W, K, R = [v[i] + v[i + 1] for i in range(0, 10, 2)]
    S, mb = B + R, branches[1]
    hua = any(HUA.get((min(ds, p), max(ds, p))) == int(HID[mb][0]) // 2 and
              [B, O, W, K, R][(int(HID[mb][0]) // 2 - ds // 2) % 5] >= 30
              for p in (stems[1], stems[2]))
    t = [v[3] >= 10 and v[7] >= 10 and R < 10, v[3] >= 15 and R >= 15,
         v[2] >= 10 and v[6] >= 10 and v[8] < 10,
         v[6] >= 15 and R >= 10 and v[2] < 10, W >= 30 and S < 25,
         B >= 25 and W >= 10 and K < 10, v[8] >= 15 and v[2] >= 10 and W < 10,
         v[6] >= 10 and v[7] >= 10 and O < 10,
         v[5] >= 10 and v[7] >= 10 and S >= 30 and v[3] < 10 and v[6] < 10,
         v[2] >= 5 and v[3] >= 5 and O >= 15 and W >= 15 and S >= 30,
         v[6] >= 20 and abs(S - K) <= 7,
         S >= 40 and 5 <= v[6] < 15 and W >= 15 and v[2] < 10,
         REN.get(ds) in branches and v[6] >= 10, R >= 30 and B < 10,
         R >= 10 and W >= 20 and W >= R + 10 and S < 40,
         v[7] >= 10 and R >= 10 and v[3] < 10 and W < 20,
         v[2] >= 10 and v[3] < 5 and W >= 15 and S >= 30,
         v[3] >= 10 and v[2] < 5 and W >= 15 and S >= 30,
         B >= 15 and R < 10 and O + W + K >= 45, S <= 6 and W >= 40,
         S <= 6 and K >= 40, R <= 3 and O >= 40 and K < 10,
         B >= 50 and K <= 3, hua]
    return [i for i, x in enumerate(t) if x]

def charts():
    """60 year pillars x 12 months x 60 day pillars x 12 hours."""
    for yg in range(60):
        for mi in range(12):
            ms, mb = (yg % 10 * 2 + 2 + mi) % 10, (2 + mi) % 12
            for dg in range(60):
                for hb in range(12):
                    ds = dg % 10
                    yield ds, (yg % 10, ms, (ds * 2 + hb) % 10), \
                        (yg % 12, mb, dg % 12, hb)

if __name__ == "__main__":
    n, dom, month, band = 0, [0] * 10, 0, [0, 0, 0]
    for ds, st, br in charts():
        v = points(ds, st, br)
        d = dominant(ds, v, br[1])
        n += 1
        dom[d] += 1
        month += d == god(ds, int(HID[br[1]][0]))
        s = v[0] + v[1] + v[8] + v[9]
        band[0 if s < 25 else (1 if s < 40 else 2)] += 1
    print("   charts: {}  (80 points each)".format(n))
    for g in sorted(range(10), key=lambda g: -dom[g]):
        print("     {:12s} {:6d}  {:.4f}".format(GODS[g], dom[g], dom[g] / n))
    yang = sum(dom[g] for g in range(0, 10, 2))
    print("   same-polarity gods dominate: {:.4f}".format(yang / n))
    print("   dominant god = month branch main-qi god: {:.4f}".format(month / n))
    print("   self points S: below 25 {:.4f}, 25 to 39 {:.4f}, 40 or more {:.4f}"
          .format(*[b / n for b in band]))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《子平调候张力与十神人性博弈母典》第 7 章「十神与二十四组合:谁在盘里说话,谁和谁结伴」(版本 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}
}

本书其他章节结论