关于「八十一组数对:每一宫的静与动」,《玄空声光场与汉堡择时》给出的定量结论是什么?
结论:本章写完了八十一组山向数对。读每一组看三样:五行生克(静生动、动生静、静克动、动克静、比和),古诀的名目(一四同宫、二五交加、斗牛煞、交剑煞、九七合辙、火烧天门、紫黄毒药,以及河图四对),以及当运时令。p25 表明,九运的标准盘只有九组数对,每张盘各用一次,两数之和都是 9 的倍数;八运有 41 组。p26 表明九运盘三分之二的宫位是相克的组合,而且全部九个运里只有 5-5 永不出现。p27 列出了每一组的来源运。直断的原则可以压成一句:静处看山星能不能让人安睡久坐,动处看向星值不值得开门走动;当令的数放在要用的地方,失令的数和五黄放在少用的地方。
数据口径:两套传统按原有算法写准、算尽;三者的组合是本书的处方,也是一个可检验的假说,不是已被证实的效果。 全部计算由书中程序生成;本书不构成医疗、建筑安全、投资或心理方面的专业建议。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 27, 41
| period 9: rows = mountain star a, columns = facing star b | |
| 1 | 2 3 4 5 6 7 8 9 |
| 1 | 0 0 0 0 0 0 0 24 0 |
| 2 | 0 0 0 0 0 0 24 0 0 |
| 3 | 0 0 0 0 0 24 0 0 0 |
| 4 | 0 0 0 0 24 0 0 0 0 |
| 5 | 0 0 0 24 0 0 0 0 0 |
| 6 | 0 0 24 0 0 0 0 0 0 |
| 7 | 0 24 0 0 0 0 0 0 0 |
| 8 | 24 0 0 0 0 0 0 0 0 |
| 9 | 0 0 0 0 0 0 0 0 24 |
| slots 216, pairs seen 9, never seen 72 | |
| period 8: rows = mountain star a, columns = facing star b | |
| 1 | 2 3 4 5 6 7 8 9 |
| 1 | 0 0 3 3 0 12 3 3 0 |
| 2 | 0 0 0 3 15 0 0 3 3 |
| 3 | 3 0 0 12 3 3 0 0 3 |
| 4 | 3 3 12 0 0 3 3 0 0 |
| 5 | 0 15 3 0 0 0 3 3 0 |
| 6 | 12 0 3 3 0 0 0 3 3 |
| 7 | 3 0 0 3 3 0 0 0 15 |
| 8 | 3 3 0 0 3 3 0 12 0 |
| 9 | 0 3 3 0 0 3 15 0 0 |
| slots 216, pairs seen 41, never seen 40 | |
| both periods | 432 slots, uniform share per pair 0.0123 |
| most frequent (27 slots, 0.0625) | 1-8 3-6 6-3 8-1 |
| never seen in either period | 1-1 1-2 1-5 1-9 2-1 2-2 2-3 2-6 3-2 3-3 3-7 3-8 4-4 4-8 4-9 5-1 5-5 5-6 5-9 6-2 6-5 6-6 6-7 7-3 7-6 7-7 7-8 8-3 8-4 8-7 8-9 9-1 9-4 9-5 9-8 |
| equal pairs a-a | 36 slots (0.0833); sum-to-ten pairs: 12 slots (0.0278) |
查看完整验算程序
# Chapter 5. p25: How often each mountain-facing pair occurs in the 48 charts of periods 9 and 8.
# Method (the house xuankong arithmetic, as in the earlier flying-star book):
# the period chart puts the period number P in the centre and flies it
# forward along C, NW, W, NE, S, N, SW, E, SE. The mountain-star chart
# takes as its centre the period-chart number n in the sitting palace,
# the facing-star chart the number in the facing palace. Each side chart
# flies forward or backward by the polarity of the mountain in the same
# position (earth, heaven, man) inside the palace whose Lo Shu number is
# n; when n = 5 the sitting (or facing) palace itself is used. Only the
# standard charts are built (no replacement stars). Every chart has nine
# palaces, so 24 sitting mountains give 216 palace slots per period. For
# each pair "a-b" (mountain star a, facing star b) we count the slots.
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"]
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):
cardinal = number in (1, 3, 7, 9)
return (1, -1, -1)[pos] if cardinal else (-1, 1, 1)[pos]
def side(base, pal, pos):
n = base[pal]
ref = LOSHU[pal] if n == 5 else n
return fly(n, polarity(ref, pos))
def chart(period, i):
base = fly(period, 1)
sit = PAL_ORDER[i // 3]
face = OPP[sit]
return base, side(base, sit, i % 3), side(base, face, i % 3)
def counts(period):
c = {(a, b): 0 for a in range(1, 10) for b in range(1, 10)}
for i in range(24):
base, m, f = chart(period, i)
for p in PATH:
c[(m[p], f[p])] += 1
return c
if __name__ == "__main__":
tot = {k: 0 for k in counts(9)}
for per in (9, 8):
c = counts(per)
print(" period {}: rows = mountain star a, columns = facing star b".format(per))
print(" " + " ".join("{:3d}".format(b) for b in range(1, 10)))
for a in range(1, 10):
print(" {:3d} ".format(a) + " ".join(
"{:3d}".format(c[(a, b)]) for b in range(1, 10)))
zero = [k for k in c if c[k] == 0]
print(" slots {}, pairs seen {}, never seen {}".format(
sum(c.values()), 81 - len(zero), len(zero)))
for k in tot:
tot[k] += c[k]
n = sum(tot.values())
top = max(tot.values())
print("\n both periods: {} slots, uniform share per pair {:.4f}".format(n, 1 / 81))
print(" most frequent ({} slots, {:.4f}): {}".format(top, top / n, " ".join(
"{}-{}".format(*k) for k in sorted(tot) if tot[k] == top)))
print(" never seen in either period: {}".format(" ".join(
"{}-{}".format(*k) for k in sorted(tot) if tot[k] == 0) or "none"))
same = sum(tot[(a, a)] for a in range(1, 10))
ten = sum(tot[(a, 10 - a)] for a in range(1, 10))
print(" equal pairs a-a: {} slots ({:.4f}); sum-to-ten pairs: {} slots ({:.4f})".format(
same, same / n, ten, ten / n))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《玄空飞星空间声光场与汉堡中点择时母典》第 5 章「八十一组数对:每一宫的静与动」(版本 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}
}