5D Library › 黄历择吉布尔格、建除十二直同余与卢恩符文组合学 · English
第四章 可满足性:没有一天可用,与每一天都既吉又凶
把请求看作可满足性问题
有人问「下个月里哪天宜嫁娶」,就是提出一个约束满足问题:在时间窗内找一天 ,使所有凶的谓词都不成立。规则组越加越多,问题可能变得无解。问题在于:对一个月和一周的时间窗,这有多常见。
推导
# Chapter 4. p07: Is there any acceptable day in the next 30 days?
# For every 30-day window starting on a day of 2027 (336 windows that
# end inside the year), count the days free of all bad marks of rule
# sets R1..Rk of p01, for k = 1 to 7, and the share of windows with no
# such day: the request "a pure day this month" is then unsatisfiable.
# The same with a 7-day window (a wedding someone wants next week).
import datetime
OFFICERS = ("jian chu man ping ding zhi po wei cheng shou kai bi").split()
# the 12 "jie" of 2027, Beijing time (UTC+8), from NAOJ's 2027 table
JIE = ((1, 5, 22, 10), (2, 4, 9, 46), (3, 6, 3, 40), (4, 5, 8, 17),
(5, 6, 1, 25), (6, 6, 5, 26), (7, 7, 15, 37), (8, 8, 1, 27),
(9, 8, 4, 28), (10, 8, 20, 17), (11, 7, 23, 39), (12, 7, 16, 38))
D0 = datetime.date(2027, 1, 1) # geng-chen day, mansion Gui (22)
def days(offset_h=0):
"""One dict per day of 2027: stem, branch, month and year branch."""
jie = [datetime.datetime(2027, m, d, h, mi) +
datetime.timedelta(hours=offset_h) for m, d, h, mi in JIE]
out = []
for k in range(365):
day = D0 + datetime.timedelta(days=k)
n = sum(1 for j in jie if j.date() <= day) # jie passed
gz = (16 + k) % 60
out.append({"date": day, "gz": gz, "s": gz % 10, "b": gz % 12,
"M": n % 12, "Y": 6 if n < 2 else 7,
"mansion": (22 + k) % 28})
return out
GOOD_OFFICER = {1, 4, 5, 7, 8, 10} # chu ding zhi wei cheng kai
QINGLONG = {2: 0, 8: 0, 3: 2, 9: 2, 4: 4, 10: 4, 5: 6, 11: 6,
0: 8, 6: 8, 1: 10, 7: 10} # month branch -> Azure Dragon day
YELLOW = {0, 1, 4, 5, 7, 10} # the six "yellow road" gods
SANSHA = {8: (5, 6, 7), 0: (5, 6, 7), 4: (5, 6, 7),
2: (11, 0, 1), 6: (11, 0, 1), 10: (11, 0, 1),
5: (2, 3, 4), 9: (2, 3, 4), 1: (2, 3, 4),
11: (8, 9, 10), 3: (8, 9, 10), 7: (8, 9, 10)}
BAD_MANSION = {1, 2, 4, 8, 9, 10, 11, 14, 17, 19, 22, 23, 26} # model
TIANDE = {2: ("s", 3), 3: ("b", 8), 4: ("s", 8), 5: ("s", 7),
6: ("b", 11), 7: ("s", 0), 8: ("s", 9), 9: ("b", 2),
10: ("s", 2), 11: ("s", 1), 0: ("b", 5), 1: ("s", 6)}
YUEDE = {2: 2, 6: 2, 10: 2, 8: 8, 0: 8, 4: 8, 11: 0, 3: 0, 7: 0,
5: 6, 9: 6, 1: 6}
TIANSHE = {2: 14, 3: 14, 4: 14, 5: 30, 6: 30, 7: 30,
8: 44, 9: 44, 10: 44, 11: 0, 0: 0, 1: 0}
def officer(d):
return (d["b"] - d["M"]) % 12
def marks(d, births=(0, 3)):
"""Bad marks (rule sets R1..R7) and good marks of one day."""
bad = {
"R1 officer": officer(d) not in GOOD_OFFICER,
"R2 black road": (d["b"] - QINGLONG[d["M"]]) % 12 not in YELLOW,
"R3 year breaker": d["b"] == (d["Y"] + 6) % 12,
"R4 three sha": d["b"] in SANSHA[d["M"]],
"R5 mansion": d["mansion"] in BAD_MANSION,
"R6 clash A": d["b"] == (births[0] + 6) % 12,
"R7 clash B": d["b"] == (births[1] + 6) % 12,
}
kind, v = TIANDE[d["M"]]
good = {
"tian de": d[kind] == v,
"yue de": d["s"] == YUEDE[d["M"]],
"tian she": d["gz"] == TIANSHE[d["M"]],
}
return bad, good
if __name__ == "__main__":
ds = days()
names = list(marks(ds[0])[0])
flags = [marks(d)[0] for d in ds]
print(" rules 30-day window: mean free days, none free "
"7-day: none free")
for k in range(1, 8):
ok = [not any(f[n] for n in names[:k]) for f in flags]
res = []
for w in (30, 7):
wins = [sum(ok[s:s + w]) for s in range(365 - w + 1)]
res.append((sum(wins) / len(wins),
sum(1 for x in wins if x == 0) / len(wins)))
print(" R1..R{} {:6.2f} {:.3f} {:.3f}"
.format(k, res[0][0], res[0][1], res[1][1]))
# rules 30-day window: mean free days, none free 7-day: none free
# R1..R1 15.23 0.000 0.000
# R1..R2 7.77 0.000 0.084
# R1..R3 6.98 0.021 0.164
# R1..R4 5.71 0.021 0.206
# R1..R5 3.29 0.033 0.440
# R1..R6 2.86 0.057 0.496
# R1..R7 2.86 0.057 0.496只看建除,30 天的时间窗平均有 15.23 个可用日,从不为零。七组规则全部加上,平均只有 2.86 天,0.057 的 30 天时间窗里根本没有可用日。7 天的时间窗情形更糟:建除加黑道,0.084 的星期没有可用日;再加凶宿,0.440;再加两人的冲日,0.496。一对想「下周挑个好日子」的新人,在七组规则下有一半机会提出的是无解的请求,通书只好放宽某条规则,而这是一个选择,不是一个计算。
既吉又凶的日子
相反的问题同样常见。大多数日子同时带有至少一个吉标与至少一个凶标,判定取决于让哪个标记胜出。
推导
# Chapter 4. p08: Every day carries a good mark and a bad mark.
# Good marks: tian de, yue de, tian she, a good officer, a yellow-road
# god. Bad marks: rule sets R1..R5 of p01 (no personal clashes). A day
# whose marks point both ways can be called good or bad depending on
# which mark the reader lets win. Counted for 2027: days with only good
# marks, only bad marks, both, and neither.
import datetime
OFFICERS = ("jian chu man ping ding zhi po wei cheng shou kai bi").split()
# the 12 "jie" of 2027, Beijing time (UTC+8), from NAOJ's 2027 table
JIE = ((1, 5, 22, 10), (2, 4, 9, 46), (3, 6, 3, 40), (4, 5, 8, 17),
(5, 6, 1, 25), (6, 6, 5, 26), (7, 7, 15, 37), (8, 8, 1, 27),
(9, 8, 4, 28), (10, 8, 20, 17), (11, 7, 23, 39), (12, 7, 16, 38))
D0 = datetime.date(2027, 1, 1) # geng-chen day, mansion Gui (22)
def days(offset_h=0):
"""One dict per day of 2027: stem, branch, month and year branch."""
jie = [datetime.datetime(2027, m, d, h, mi) +
datetime.timedelta(hours=offset_h) for m, d, h, mi in JIE]
out = []
for k in range(365):
day = D0 + datetime.timedelta(days=k)
n = sum(1 for j in jie if j.date() <= day) # jie passed
gz = (16 + k) % 60
out.append({"date": day, "gz": gz, "s": gz % 10, "b": gz % 12,
"M": n % 12, "Y": 6 if n < 2 else 7,
"mansion": (22 + k) % 28})
return out
GOOD_OFFICER = {1, 4, 5, 7, 8, 10} # chu ding zhi wei cheng kai
QINGLONG = {2: 0, 8: 0, 3: 2, 9: 2, 4: 4, 10: 4, 5: 6, 11: 6,
0: 8, 6: 8, 1: 10, 7: 10} # month branch -> Azure Dragon day
YELLOW = {0, 1, 4, 5, 7, 10} # the six "yellow road" gods
SANSHA = {8: (5, 6, 7), 0: (5, 6, 7), 4: (5, 6, 7),
2: (11, 0, 1), 6: (11, 0, 1), 10: (11, 0, 1),
5: (2, 3, 4), 9: (2, 3, 4), 1: (2, 3, 4),
11: (8, 9, 10), 3: (8, 9, 10), 7: (8, 9, 10)}
BAD_MANSION = {1, 2, 4, 8, 9, 10, 11, 14, 17, 19, 22, 23, 26} # model
TIANDE = {2: ("s", 3), 3: ("b", 8), 4: ("s", 8), 5: ("s", 7),
6: ("b", 11), 7: ("s", 0), 8: ("s", 9), 9: ("b", 2),
10: ("s", 2), 11: ("s", 1), 0: ("b", 5), 1: ("s", 6)}
YUEDE = {2: 2, 6: 2, 10: 2, 8: 8, 0: 8, 4: 8, 11: 0, 3: 0, 7: 0,
5: 6, 9: 6, 1: 6}
TIANSHE = {2: 14, 3: 14, 4: 14, 5: 30, 6: 30, 7: 30,
8: 44, 9: 44, 10: 44, 11: 0, 0: 0, 1: 0}
def officer(d):
return (d["b"] - d["M"]) % 12
def marks(d, births=(0, 3)):
"""Bad marks (rule sets R1..R7) and good marks of one day."""
bad = {
"R1 officer": officer(d) not in GOOD_OFFICER,
"R2 black road": (d["b"] - QINGLONG[d["M"]]) % 12 not in YELLOW,
"R3 year breaker": d["b"] == (d["Y"] + 6) % 12,
"R4 three sha": d["b"] in SANSHA[d["M"]],
"R5 mansion": d["mansion"] in BAD_MANSION,
"R6 clash A": d["b"] == (births[0] + 6) % 12,
"R7 clash B": d["b"] == (births[1] + 6) % 12,
}
kind, v = TIANDE[d["M"]]
good = {
"tian de": d[kind] == v,
"yue de": d["s"] == YUEDE[d["M"]],
"tian she": d["gz"] == TIANSHE[d["M"]],
}
return bad, good
if __name__ == "__main__":
ds = days()
rows = {"only good": 0, "only bad": 0, "both": 0, "neither": 0}
virtue_bad = 0
for d in ds:
bad, good = marks(d)
g = any(good.values()) or not bad["R1 officer"] or \
not bad["R2 black road"]
b = any(v for k, v in bad.items() if k[:2] in
("R1", "R2", "R3", "R4", "R5"))
key = "both" if g and b else "only good" if g else \
"only bad" if b else "neither"
rows[key] += 1
if any(good.values()) and (bad["R3 year breaker"] or
bad["R4 three sha"]):
virtue_bad += 1
for k, v in rows.items():
print(" {:9s}: {:3d} days ({:.3f})".format(k, v, v / 365))
print(" a virtue (tian de, yue de, tian she) on a year-breaker or")
print(" three-sha day: {} days".format(virtue_bad))
# only good: 38 days (0.104)
# only bad : 75 days (0.205)
# both : 252 days (0.690)
# neither : 0 days (0.000)
# a virtue (tian de, yue de, tian she) on a year-breaker or
# three-sha day: 25 days2027 年按五种吉标(天德、月德、天赦、吉的值神、黄道)与五种凶标计数,只带吉标的日子只有 38 天(0.104),只带凶标的 75 天(0.205);252 天(0.690)两者都有,没有一天两者皆无。有 25 天是天德、月德或天赦落在岁破或三煞日上,这正是各流派对「德能否化煞」意见不一的典型情形。所以一年中七成的日子,要由规则的排序来决定,第七章将讨论这一点。
假说 · 尚未验证
作者的诠释(尚未验证): 给择日师同一对新人、同一个星期,当这一周没有任何一天避开他们的全部凶标时,大多数情况下他们会选出不同的日子;当恰好有一天时,大多数情况下他们意见一致。什么会证明它错: 当这一周没有完全无凶的日子时,择日师之间的一致程度并不下降。
小结
七组规则下,0.057 的 30 天时间窗与 0.496 的 7 天时间窗里没有可用日。同时,一年中 0.690 的日子既有吉标又有凶标。所以通书的判定,主要是决定哪条规则胜出,而不是从日历上读出的事实。
Fan, Y. (2026). Almanac Auspicious Boolean Lattices, Jianchu Twelve-Officer Congruences and Runic Combinatorics: Constraint Satisfaction Paradoxes, Solar-Term Phase Jumps and Elder Futhark Inversion Distributions [黄历择吉布尔格、建除十二直同余与卢恩符文组合学] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090239 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).