关于「八运二十四山:旧宅的声光场与入九运的重排」,《玄空声光场与汉堡择时》给出的定量结论是什么?

结论:八运的二十四盘四类各占六盘,与九运没有一个坐山同类。本章用与第二章相同的规则(p16)给每一宅分了四区:旺山旺向的六宅动线在前、床在后,上山下水的六宅反过来。p17 给出了最实际的结论:没有一宅的床可以在入九运后留在原地,十六宅的四个区全部要换位置,动线留得住的只有坐丑、坐艮、坐寅、坐辰、坐巽、坐巳六宅。

数据口径:两套传统按原有算法写准、算尽;三者的组合是本书的处方,也是一个可检验的假说,不是已被证实的效果。 全部计算由书中程序生成;本书不构成医疗、建筑安全、投资或心理方面的专业建议。

English version

对照数据表

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

rendoor N>Sbed S>Ndesk SW>NEstore SE>SE stays
zidoor S>Nbed N>Sdesk NE>SWstore E>NW
guidoor S>Nbed N>Sdesk NE>SWstore E>NW
choudoor SW>SW staysbed NE>Edesk N>N staysstore SE>W
gendoor NE>NE staysbed SW>Wdesk S>S staysstore NW>E
yindoor NE>NE staysbed SW>Wdesk S>S staysstore NW>E
jiadoor E>Wbed SW>NEdesk SE>NWstore S>E
maodoor W>Ebed NE>SWdesk NW>SEstore N>NE
yidoor W>Ebed NE>SWdesk NW>SEstore N>NE
chendoor SE>SE staysbed NW>Edesk W>NWstore N>NE
xundoor NW>NW staysbed SE>Wdesk E>SEstore S>N
sidoor NW>NW staysbed SE>Wdesk E>SEstore S>N
bingdoor N>Sbed SW>NEdesk S>Nstore SE>SE stays
wudoor S>Nbed NE>SWdesk N>Sstore E>NW
dingdoor S>Nbed NE>SWdesk N>Sstore E>NW
weidoor NE>SWbed SW>Ndesk S>Estore SE>W
kundoor SW>NEbed NE>Sdesk N>Wstore NW>E
shendoor SW>NEbed NE>Sdesk N>Wstore NW>E
gengdoor E>Wbed SE>NWdesk SW>NEstore S>E
youdoor W>Ebed NW>SEdesk NE>SWstore N>NE
xindoor W>Ebed NW>SEdesk NE>SWstore N>NE
xudoor NW>SEbed SE>NWdesk W>Estore N>NE
qiandoor SE>NWbed NW>SEdesk E>Wstore S>N
haidoor SE>NWbed NW>SEdesk E>Wstore S>N
roles kept in place, of 24: door 6, bed 0, desk 3, store 2
houses where every role moves: 16 of 24
查看完整验算程序
# Chapter 3. p17: A period-8 house re-occupied in period 9: which zone
# roles stay and which must move, mountain by mountain.
# For each sitting mountain the rule of p13 and p16 is applied to the
# period-8 chart and to the period-9 chart of the same mountain (the
# re-occupation case: a house built 2004-2023 whose owners re-settle it
# after 2024, which this book reads with the period-9 chart). The
# program prints, per mountain, the palace of each role in both periods
# and marks a role "stays" when its palace is unchanged; then it counts
# how many of the 24 houses keep each role in place.
LOSHU = {"SE": 4, "S": 9, "SW": 2, "E": 3, "C": 5, "W": 7,
         "NE": 8, "N": 1, "NW": 6}
PATH = ["C", "NW", "W", "NE", "S", "N", "SW", "E", "SE"]
OPP = {"N": "S", "S": "N", "E": "W", "W": "E", "NE": "SW", "SW": "NE",
       "NW": "SE", "SE": "NW"}
PAL_ORDER = ["N", "NE", "E", "SE", "S", "SW", "W", "NW"]
MOUNTAINS = ("ren zi gui chou gen yin jia mao yi chen xun si bing wu "
             "ding wei kun shen geng you xin xu qian hai").split()

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

def fly(c, sign):
    return {p: norm(c + sign * k) for k, p in enumerate(PATH)}

def polarity(number, pos):
    return (1, -1, -1)[pos] if number in (1, 3, 7, 9) else (-1, 1, 1)[pos]

def side(base, pal, pos):
    n = base[pal]
    return fly(n, polarity(LOSHU[pal] if n == 5 else n, pos))

def chart(period, i):
    base = fly(period, 1)
    sit = PAL_ORDER[i // 3]
    face = OPP[sit]
    return side(base, sit, i % 3), side(base, face, i % 3), sit, face

def weight(s, P):
    timely = {P: 3, norm(P + 1): 2, norm(P + 2): 1, norm(P - 1): 1}
    if s in timely:
        return timely[s]
    return -2 if s == 5 else (-1 if s in (2, 3, 7) else 0)

def roles(P, i):
    m, f, sit, face = chart(P, i)
    w = {p: (weight(m[p], P), weight(f[p], P)) for p in PAL_ORDER}
    free = list(PAL_ORDER)
    door = max(free, key=lambda p: (w[p][1], p == face))
    free.remove(door)
    bed = max(free, key=lambda p: (w[p][0], p == sit, -w[p][1]))
    free.remove(bed)
    desk = max(free, key=lambda p: (sum(w[p]), w[p][1]))
    free.remove(desk)
    store = min(free, key=lambda p: (sum(w[p]), 5 not in (m[p], f[p])))
    return [(r, p, m[p], f[p]) for r, p in
            (("door", door), ("bed", bed), ("desk", desk), ("store", store))]

if __name__ == "__main__":
    names = ("door", "bed", "desk", "store")
    keep = dict.fromkeys(names, 0)
    for i, name in enumerate(MOUNTAINS):
        a, b = roles(8, i), roles(9, i)
        cells = []
        for k, r in enumerate(names):
            stay = a[k][1] == b[k][1]
            keep[r] += stay
            cells.append("{} {}>{}{}".format(r, a[k][1], b[k][1],
                                             " stays" if stay else ""))
        print("  {:5s} ".format(name) + "  ".join(cells))
    print("roles kept in place, of 24: " + ", ".join(
        "{} {}".format(r, keep[r]) for r in names))
    none = sum(1 for i in range(24)
               if all(x[1] != y[1] for x, y in zip(roles(8, i), roles(9, i))))
    print("houses where every role moves: {} of 24".format(none))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《玄空飞星空间声光场与汉堡中点择时母典》第 3 章「八运二十四山:旧宅的声光场与入九运的重排」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026122,
  author    = {Fan, Yafu},
  title     = {The Xuankong Flying-Star Sound-and-Light Field and Hamburg Midpoint Timing Codex},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论