关于「七十二个局数与两种定局历法」,《纳甲与奇门的组合计算》给出的定量结论是什么?

结论:第三章证明奇门 72 个节气局数由八个起宫与两条步长规则生成,1,080 是 18 局乘 60 时辰;逐时比较 2000 年到 2029 年的拆补法与置闰法,两者在 0.3067 的时辰给出不同的局,0.0219 连阴阳遁都不同。

数据口径:书中以标注框区分证据、16 段可运行的 Python 程序、原典与假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 1080, 18, 60, 72

   verse table = closed form for all 24 terms x 3 yuan: True
   Dong Zhi     upper/middle/lower: 1 7 4
   Li Chun      upper/middle/lower: 8 5 2
   Xia Zhi      upper/middle/lower: 9 3 6
   Li Dong      upper/middle/lower: 6 9 3
   each bureau number serves 4 term-yuan pairs per dun: True
   bureaus: 9 numbers x 2 duns = 18;  x 60 double-hours = 1,080
   term-yuan pairs: 24 x 3 = 72
Reading: the 72 numbers of the verse are generated by eight
starting palaces and two step rules: +1 per term and +6 per yuan
in yang dun, -1 and +3 in yin dun. Each of the 18 bureaus is used
by exactly four term-yuan pairs.
查看完整验算程序
# Chapter 3. The 72 bureau numbers of the solar terms, in closed form.
# Time-family Qimen uses yang dun from the Winter Solstice and yin dun
# from the Summer Solstice; each of the 24 terms has an upper, middle
# and lower "yuan" with its own bureau number 1-9. The verse table is
# copied below as usually printed. Closed form: the terms come in eight
# groups of three, one per trigram palace p of the Later Heaven square
# (yang: Kan 1, Gen 8, Zhen 3, Xun 4; yin: Li 9, Kun 2, Dui 7, Qian 6).
# The k-th term of a group (k = 0, 1, 2) has upper yuan p + k (yang) or
# p - k (yin); middle and lower add 6 and 12 (yang) or 3 and 6 (yin),
# all modulo 9 with 0 written as 9.
TERMS = ("Dong Zhi", "Xiao Han", "Da Han", "Li Chun", "Yu Shui",
         "Jing Zhe", "Chun Fen", "Qing Ming", "Gu Yu", "Li Xia",
         "Xiao Man", "Mang Zhong", "Xia Zhi", "Xiao Shu", "Da Shu",
         "Li Qiu", "Chu Shu", "Bai Lu", "Qiu Fen", "Han Lu", "Shuang Jiang",
         "Li Dong", "Xiao Xue", "Da Xue")
VERSE = ("174 285 396 852 963 174 396 417 528 417 528 639 "
         "936 825 714 258 147 936 714 693 582 693 582 471").split()
PALACES = (1, 8, 3, 4, 9, 2, 7, 6)

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

def closed(i):
    group, k = divmod(i, 3)
    p = PALACES[group]
    if i < 12:
        up = nine(p + k)
        return up, nine(up + 6), nine(up + 12)
    up = nine(p - k)
    return up, nine(up + 3), nine(up + 6)

if __name__ == "__main__":
    ok = all("".join(map(str, closed(i))) == VERSE[i] for i in range(24))
    print("   verse table = closed form for all 24 terms x 3 yuan: {}".format(
        ok))
    for i in (0, 3, 12, 21):
        print("   {:12s} upper/middle/lower: {} {} {}".format(
            TERMS[i], *closed(i)))
    used = {}
    for i in range(24):
        for b in closed(i):
            used[(i < 12, b)] = used.get((i < 12, b), 0) + 1
    print("   each bureau number serves 4 term-yuan pairs per dun: {}".format(
        set(used.values()) == {4}))
    print("   bureaus: 9 numbers x 2 duns = {};  x 60 double-hours = {:,d}"
          .format(9 * 2, 9 * 2 * 60))
    print("   term-yuan pairs: 24 x 3 = {}".format(24 * 3))
    print("\nReading: the 72 numbers of the verse are generated by eight")
    print("starting palaces and two step rules: +1 per term and +6 per yuan")
    print("in yang dun, -1 and +3 in yin dun. Each of the 18 bureaus is used")
    print("by exactly four term-yuan pairs.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《纳甲装卦与奇门遁甲排盘的组合计算》第 3 章「七十二个局数与两种定局历法」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090182

DOI: 10.5281/zenodo.24090182 · 阅读本章所在专著 · 5DL-B-067 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026067,
  author    = {Fan, Yafu},
  title     = {Najia Hexagram Encoding and Qimen Dunjia Combinatorial Engines},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090182},
  url       = {https://doi.org/10.5281/zenodo.24090182}
}

本书其他章节结论