关于「应期十二法:用爻的状态与兑现之日」,《六爻多爻同动、暗动伏神与应期》给出的定量结论是什么?
结论:应期之前先定四件事:用爻是哪一爻,旺还是衰,空不空,动还是静。十二法各由一个用爻状态触发、由一个地支兑现:旺相逢值,合住逢冲,冲散逢合,旺空待冲,衰空等填实,动空待出旬,入墓待冲墓,太过待入墓,休囚待生旺,临绝待长生,静而旺者待冲,动者待合。p30 显示十二法覆盖了所有情形,平均每个用爻同时有 1.8307 条法则成立,最常见的是生旺(0.3713)。p31 显示按先去病、后取近定出的应期平均在 4.35 天之后,并且 12 天之内必然有日子可报,这是地支轮回的性质,不是命中的证据;真正值得检验的,是候选日子互相冲突的那 0.3690 的卦里,取舍规则是否比随手取最早一天更准。p32 把干支日换成公历日,第七章用它给四个实际起卦写出日期。
数据口径:全部计算由书中程序生成;本书不是投资、法律、心理或婚姻建议。 书中以标注框区分已发表的证据、可运行的 Python 计算、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.3690, 12, 4.35
| FengZhi | mean wait | 6.60 days, max 12 |
| FengChong | mean wait | 6.08 days, max 12 |
| FengHe | mean wait | 6.09 days, max 12 |
| ChongKong | mean wait | 6.60 days, max 12 |
| TianShi | mean wait | 6.00 days, max 11 |
| ChuKong | mean wait | 6.00 days, max 11 |
| ChuMu | mean wait | 6.10 days, max 12 |
| RuMu | mean wait | 7.19 days, max 12 |
| ShengWang mean wait 3.98 days, max 8 | ||
| JueSheng | mean wait | 3.86 days, max 12 |
| JingChong | mean wait | 6.00 days, max 11 |
| DongHe | mean wait | 6.47 days, max 12 |
| obstacle present 0.4324, absent 0.5676 | ||
| rule supplies the call: FengZhi 0.1128, FengChong 0.0909, FengHe 0.0302, ChongKong 0.0484, TianShi 0.0563, ChuKong 0.0289, ChuMu 0.0900, RuMu 0.0485, ShengWang 0.3102, JueSheng 0.0982, JingChong 0.0648, DongHe 0.0528 | ||
| mean wait of the call: 4.35 days | ||
| call within 6 days 0.8128, within 12 days 1.0000 | ||
| candidates of the deciding group name two or more different days: 0.3690 | ||
查看完整验算程序
# Chapter 6. p31: How long each timing rule makes you wait, and the call.
# Same line states, weights and rules as p30. Each rule names one or two
# fulfilling branches: FengZhi, TianShi b; FengChong, ChongKong, JingChong
# the branch clashing b; FengHe, DongHe the branch combining b; ChuKong b or
# its clash, but only after the current xun ends; ChuMu the clash of the
# tomb; RuMu the tomb; ShengWang the birth or peak branch; JueSheng the birth
# branch. Wait = days from the cast day to the first such day (1 to 12).
# The call: if any obstacle rule applies (ChongKong TianShi ChuKong ChuMu
# JueSheng FengHe FengChong), the call is the earliest day among them;
# otherwise it is the earliest day among the other five rules (FengZhi RuMu
# ShengWang JingChong DongHe). "Supplies" counts every rule that names it.
BEL = (4, 2, 0, 0, 2, 1, 1, 2, 3, 3, 2, 4)
TOMB, JUE = (7, 10, 4, 1, 4), (8, 11, 5, 2, 5)
TRI = ((0, 0, 0), (1, 0, 0), (0, 1, 0), (1, 1, 0), (0, 0, 1), (1, 0, 1),
(0, 1, 1), (1, 1, 1)) # Kun Zhen Kan Dui Gen Li Xun Qian
START = (7, 0, 2, 5, 4, 3, 1, 0)
YANG = (0, 1, 1, 0, 1, 0, 0, 1)
NAMES = ("FengZhi", "FengChong", "FengHe", "ChongKong", "TianShi", "ChuKong",
"ChuMu", "RuMu", "ShengWang", "JueSheng", "JingChong", "DongHe")
def najia(h):
out = []
for t, base in ((TRI.index(h[:3]), 0), (TRI.index(h[3:]), 6)):
step = 2 if YANG[t] else -2
out += [(START[t] + base + step * k) % 12 for k in range(3)]
return out
def states():
acc = {}
for code in range(4096):
v = [(6, 7, 8, 9)[(code >> (2 * i)) & 3] for i in range(6)]
w = 1
for x in v:
w *= 1 if x in (6, 9) else 3
h = tuple(int(x in (7, 9)) for x in v)
ch = tuple(b ^ (x in (6, 9)) for b, x in zip(h, v))
o, c = najia(h), najia(ch)
for i in range(6):
k = (o[i], v[i] in (6, 9), c[i] if v[i] in (6, 9) else None)
acc[k] = acc.get(k, 0) + w
return acc
def rules(b, mv, c, day, mon):
e, d, me = BEL[b], day % 12, BEL[mon]
p = e in (me, (me + 1) % 5)
first = (day % 12 - day % 10 + 10) % 12
v = b in (first, (first + 1) % 12)
clash, comb = (d - b) % 12 == 6, (d + b) % 12 == 1
hc = mv and (c - b) % 12 == 6
tomb = d == TOMB[e] or (mv and c == TOMB[e])
jue = d == JUE[e] or (mv and c == JUE[e])
po = not mv and clash and not p
return (not v and p, comb or (mv and (c + b) % 12 == 1), hc or po,
not mv and v and p, not mv and v and not p, mv and v, tomb,
not v and p and BEL[d] in (e, (e - 1) % 5),
not v and not p and not tomb and not jue and not po, jue,
not mv and not v and p and not clash and not comb,
(mv or (not mv and clash and p)) and not v and not hc)
BIRTH, PEAK = (11, 2, 8, 5, 8), (3, 6, 0, 9, 0)
TIER = (2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 2)
def fulfil(i, b):
e = BEL[b]
return ((b,), ((b + 6) % 12,), ((1 - b) % 12,), ((b + 6) % 12,), (b,),
(b, (b + 6) % 12), ((TOMB[e] + 6) % 12,), (TOMB[e],),
(BIRTH[e], PEAK[e]), (BIRTH[e],), ((b + 6) % 12,),
((1 - b) % 12,))[i]
def wait(i, b, day):
t = 10 - day % 10 if i == 5 else 1
while (day + t) % 12 not in fulfil(i, b):
t += 1
return t
if __name__ == "__main__":
s, n, mx = [0] * 12, [0] * 12, [0] * 12
tier, call, split, total, sup = [0] * 3, {}, 0, 0, [0] * 12
for (b, mv, c), w in states().items():
for day in range(60):
for mon in range(12):
r = rules(b, mv, c, day, mon)
ws = {}
for i in range(12):
if r[i]:
t = wait(i, b, day)
s[i] += w * t
n[i] += w
mx[i] = max(mx[i], t)
ws.setdefault(TIER[i], {})[i] = t
top = min(ws)
tier[top] += w
d = min(ws[top].values())
call[d] = call.get(d, 0) + w
split += w * (len(set(ws[top].values())) > 1)
for i, t in ws[top].items():
sup[i] += w * (t == d)
total += w
for i in range(12):
print(" {:10s} mean wait {:5.2f} days, max {:2d}".format(
NAMES[i], s[i] / n[i], mx[i]))
print(" obstacle present {:.4f}, absent {:.4f}".format(
tier[1] / total, tier[2] / total))
print(" rule supplies the call: " + ", ".join("{} {:.4f}".format(
NAMES[i], sup[i] / total) for i in range(12)))
print(" mean wait of the call: {:.2f} days".format(
sum(d * w for d, w in call.items()) / total))
print(" call within 6 days {:.4f}, within 12 days {:.4f}".format(
sum(w for d, w in call.items() if d <= 6) / total,
sum(w for d, w in call.items() if d <= 12) / total))
print(" candidates of the deciding group name two or more different "
"days: {:.4f}".format(split / total))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《六爻多爻同动暗动伏神与精准应期母典》第 6 章「应期十二法:用爻的状态与兑现之日」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-125 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026125,
author = {Fan, Yafu},
title = {The Liuyao Codex of Multiple Moving Lines, Hidden Motion, Hidden Spirits and Timing},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}