关于「方法:调候张力、十神算术与精确分布」,《子平调候与十神博弈》给出的定量结论是什么?

结论:第一章穷举 1924 年至 2043 年共 43830 天:一百二十格每格 353 至 378 天,最多与最少之比 1.0708,没有哪一格稀少。首选调候用神只有 9 种,丙、壬、甲合占大半,丙为首选的比例是 0.2250;读成十神,多是管束或托住日主的力量。按全书的计数规则穷举 525960 张盘,主导十神接近均匀,但前两名差距不到一个透干的盘占 0.7062;首选用神透干的盘只占 0.2732。第二至第六章逐格写一百二十种日主与月令,第七章写十个十神与二十四种经典组合及其检测规则。

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

English version

对照数据表

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

days enumerated43830
stem Yin Mao Chen Si Wu Wei Shen You Xu Hai Zi Chou
Jia357 362 368 374 378 377 372 368 362 356 355 354
Yi358 362 369 374 376 378 374 367 361 357 354 353
Bing357 363 369 374 376 377 374 368 362 356 353 354
Ding357 362 369 375 378 375 374 368 361 356 354 354
Wu358 362 369 374 378 377 372 369 361 356 354 353
Ji357 363 367 374 378 377 373 367 362 356 354 355
Geng356 363 369 373 377 378 374 368 361 357 353 354
Xin357 363 369 374 376 377 374 368 362 356 354 353
Ren357 363 368 375 377 376 374 368 361 357 353 354
Gui357 363 368 375 377 377 373 367 362 357 353 354
cell mean 365.25, min 353, max 378, max/min 1.0708
chi-square against 120 equal cells23.96 on 119 df
days per month branch (share of all days):
Yin3571 0.0815
Mao3626 0.0827
Chen3685 0.0841
Si3742 0.0854
Wu3771 0.0860
Wei3769 0.0860
Shen3734 0.0852
You3678 0.0839
Xu3615 0.0825
Hai3564 0.0813
Zi3537 0.0807
Chou3538 0.0807
largest stem spread inside one month branch3 days
查看完整验算程序
# Chapter 1. p01: How often each day stem meets each month branch. Full
# calendar enumeration of the 43830 civil days from 1924-01-01 to
# 2043-12-31 (two sexagenary year cycles). Day pillar: (JDN + 49) mod 60,
# so 2000-01-01 is Wu Wu. Month branch: the sun's apparent longitude at
# local noon (UTC+8); every 30 degrees from 315 starts a month (Yin at
# 315, Mao at 345 and on round the circle). Sun by the formula of Meeus
# (Astronomical Algorithms, ch. 25), good to about 0.01 degree, i.e. a
# quarter of an hour at a month boundary. Exact counts; no sampling.
from datetime import date, timedelta
from math import sin, radians

STEMS = ("Jia", "Yi", "Bing", "Ding", "Wu", "Ji", "Geng", "Xin", "Ren", "Gui")
MONTHS = ("Yin", "Mao", "Chen", "Si", "Wu", "Wei", "Shen", "You", "Xu",
          "Hai", "Zi", "Chou")            # calendar order, index 0 = Yin

def sun_lon(jd):
    t = (jd - 2451545.0) / 36525.0
    l0 = 280.46646 + 36000.76983 * t + 0.0003032 * t * t
    m = radians(357.52911 + 35999.05029 * t - 0.0001537 * t * t)
    c = ((1.914602 - 0.004817 * t - 0.000014 * t * t) * sin(m)
         + (0.019993 - 0.000101 * t) * sin(2 * m) + 0.000289 * sin(3 * m))
    om = radians(125.04 - 1934.136 * t)
    return (l0 + c - 0.00569 - 0.00478 * sin(om)) % 360.0

def month_index(jdn, hour_local):
    jd = jdn - 0.5 + (hour_local - 8.0) / 24.0
    return int(((sun_lon(jd) - 315.0) % 360.0) // 30.0)

if __name__ == "__main__":
    d, end = date(1924, 1, 1), date(2043, 12, 31)
    cnt = [[0] * 12 for _ in range(10)]
    mlen = [0] * 12
    n = 0
    while d <= end:
        jdn = d.toordinal() + 1721425
        s, mi = (jdn + 49) % 60 % 10, month_index(jdn, 12.0)
        cnt[s][mi] += 1
        mlen[mi] += 1
        n += 1
        d += timedelta(days=1)
    print("   days enumerated: {}".format(n))
    print("   stem  " + " ".join("{:>5}".format(m) for m in MONTHS))
    for s in range(10):
        print("   {:<5} ".format(STEMS[s]) + " ".join(
            "{:>5}".format(x) for x in cnt[s]))
    flat = [x for row in cnt for x in row]
    e = n / 120.0
    chi = sum((x - e) ** 2 / e for x in flat)
    print("   cell mean {:.2f}, min {}, max {}, max/min {:.4f}".format(
        e, min(flat), max(flat), max(flat) / min(flat)))
    print("   chi-square against 120 equal cells: {:.2f} on 119 df".format(chi))
    print("   days per month branch (share of all days):")
    for i in range(12):
        print("     {:<5} {:>5}  {:.4f}".format(MONTHS[i], mlen[i], mlen[i] / n))
    # within one month branch, are the ten stems equal? (row spread)
    spread = max(max(cnt[s][i] for s in range(10)) - min(cnt[s][i]
                 for s in range(10)) for i in range(12))
    print("   largest stem spread inside one month branch: {} days".format(
        spread))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《子平调候张力与十神人性博弈母典》第 1 章「方法:调候张力、十神算术与精确分布」(版本 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}
}

本书其他章节结论