关于「方法:拆补定局、四层转盘与百格的定义」,《转盘奇门百格与六爻商业直断》给出的定量结论是什么?

结论:第一章按张志春一脉的转盘实务写拆补定局:节气以交节的确切时刻换局,上中下元以符头定。在 2024 年到 2043 年的 87,660 个时辰中,十八局的份额都在 0.0552 与 0.0559 之间,只有约三分之一的节气从上元开始,0.0055 的时辰被交节切成两张盘。甲藏于六仪,所以可见的干只有九个,干加恰好八十一种;在 9,720 个干加中八十一种全部出现,同干相加占 0.1975。十九个名格逐条写出判定规则:天遁只出现在 0.0083 的局时里,六仪击刑在 0.5296 里,门迫在 0.6667 里,一张盘平均带 3.3556 个名格。六爻一侧,单爻发动永远不会化冲。

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

English version

对照数据表

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

double-hours 2024-204387,660; bureaus used: 18
yang dun share0.4975
upper / middle / lower yuan0.3333 0.3333 0.3333
rarest bureau yang 30.0552; commonest yin 7: 0.0559
even share would be 1/180.0556
term moments480; terms entered in upper / middle / lower yuan: 158 159 163
double-hours cut by a term moment480 = 0.0055
Reading: under Chaibu a term opens in whatever yuan its day
happens to fall in; the yuan cycle never waits for the term.
查看完整验算程序
# Chapter 1. p01: Chaibu bureaus over twenty real years (2024-2043).
# Split-supplement (chai bu) as the engine does it: the bureau changes at
# the exact moment the Sun reaches the next solar term (270 + 15 i deg;
# low-accuracy solar theory of Meeus ch. 25, Delta T 69 s, UTC+8, about
# ten minutes of error); the yuan is fixed by the fu tou, the latest jia
# or ji day: zi/wu/mao/you -> upper, yin/shen/si/hai -> middle, the four
# earth branches -> lower. Bureau numbers from the closed form of the
# 72-number song (start palace + k; middle and lower add 6 in yang, 3 in
# yin). Every double-hour is sampled at its midpoint; a double-hour that
# contains a term moment is counted as split.
import math

def sun_longitude(jde):
    t = (jde - 2451545.0) / 36525
    l0 = 280.46646 + 36000.76983 * t + 0.0003032 * t * t
    m = math.radians(357.52911 + 35999.05029 * t - 0.0001537 * t * t)
    c = ((1.914602 - 0.004817 * t - 0.000014 * t * t) * math.sin(m)
         + (0.019993 - 0.000101 * t) * math.sin(2 * m)
         + 0.000289 * math.sin(3 * m))
    om = math.radians(125.04 - 1934.136 * t)
    return (l0 + c - 0.00569 - 0.00478 * math.sin(om)) % 360

def crossing(target, jd):
    for _ in range(50):
        diff = (target - sun_longitude(jd) + 180) % 360 - 180
        jd += diff / 0.9856
        if abs(diff) < 1e-7:
            break
    return jd - 69 / 86400 + 8 / 24             # local (UTC+8) Julian date

def nine(x):
    return (x - 1) % 9 + 1

def bureau(i, yuan):                            # i = 0 for Dong Zhi
    group, k = divmod(i, 3)
    p = (1, 8, 3, 4, 9, 2, 7, 6)[group]
    up = nine(p + k) if i < 12 else nine(p - k)
    return (i < 12, nine(up + (6 if i < 12 else 3) * yuan))

YUAN = {0: 0, 6: 0, 3: 0, 9: 0, 2: 1, 8: 1, 5: 1, 11: 1}

def yuan_of(t):                                 # t: local Julian date
    day = int(t + 0.5)
    fu = day - next(s for s in range(10) if (day - s + 49) % 10 in (0, 5))
    return YUAN.get((fu + 49) % 12, 2)

if __name__ == "__main__":
    jd_a, jd_b = 2460310.5, 2467615.5           # 2024-01-01, 2044-01-01
    terms = [(crossing((270 + 15 * i) % 360, jd_a - 30 + 15.22 * i), i % 24)
             for i in range(-2, 490)]
    terms = [x for x in terms if x[0] < jd_b + 20]
    count, yuans, k, split = {}, [0, 0, 0], 0, 0
    for slot in range(int((jd_b - jd_a) * 12)):
        t = jd_a + (slot + 0.5) / 12
        while terms[k + 1][0] <= t:
            k += 1
        y = yuan_of(t)
        b = bureau(terms[k][1], y)
        count[b] = count.get(b, 0) + 1
        yuans[y] += 1
        split += any(t - 1 / 24 < x <= t + 1 / 24 for x, _ in terms[k:k + 2])
    n = sum(count.values())
    inside = [x for x, _ in terms if jd_a <= x < jd_b]
    start = [0, 0, 0]
    for x in inside:
        start[yuan_of(x)] += 1
    share = sorted((c / n, b) for b, c in count.items())
    print("   double-hours 2024-2043: {:,d}; bureaus used: {}".format(
        n, len(count)))
    print("   yang dun share: {:.4f}".format(
        sum(c for b, c in count.items() if b[0]) / n))
    print("   upper / middle / lower yuan: {:.4f} {:.4f} {:.4f}".format(
        *[v / n for v in yuans]))
    lo, hi = share[0], share[-1]
    print("   rarest bureau {} {}: {:.4f};  commonest {} {}: {:.4f}".format(
        "yang" if lo[1][0] else "yin", lo[1][1], lo[0],
        "yang" if hi[1][0] else "yin", hi[1][1], hi[0]))
    print("   even share would be 1/18 = {:.4f}".format(1 / 18))
    print("   term moments: {}; terms entered in upper / middle / lower"
          " yuan: {} {} {}".format(len(inside), *start))
    print("   double-hours cut by a term moment: {} = {:.4f}".format(
        split, split / n))
    print("\nReading: under Chaibu a term opens in whatever yuan its day")
    print("happens to fall in; the yuan cycle never waits for the term.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《转盘奇门拆补法与六爻纳甲商业断事母典》第 1 章「方法:拆补定局、四层转盘与百格的定义」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026121,
  author    = {Fan, Yafu},
  title     = {The Rotating Qimen Chaibu and Liuyao Najia Codex of Business Verdicts},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论