关于「成局七法与应期九种」,《卡巴拉生命灵数、雷诺曼三十六牌组合与古典卜卦占星母典》给出的定量结论是什么?

结论:第七章:合约问题直接成局占 0.2848,未被打断的成局按月亮算不算禁止者在 0.0910 与 0.1922 之间摆动,应期单位一旦可以事后挑选,碰巧命中的机会从 0.0730 升到 0.4790。

数据口径:本书不是投资、法律、税务、医疗或心理建议。

English version

对照数据表

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

6000 contract questions (querent = ruler of 1, other party = ruler of 7)
direct0.2848
prohibition0.1933
prohibition_no_moon 0.0837
frustration0.0122
refranation0.0110
translation0.1227
collection0.0172
reception0.0212
direct and not interrupted0.0910
some route to perfection (yes-lean) 0.2288
uniform-sign reference for reception:
Mars-Venus (2/12)*(2/12)0.0278; Moon-Saturn (1/12)*(2/12) = 0.0139
direct, interrupted only if the third body is not the Moon: clean share 0.1922
查看完整验算程序
# Chapter 7. p73: How often each of the seven modes of perfection turns up in a contract question.
# Same coarse circular sky as p62 (seed 73, 6000 question moments over 2000-2049), positions every
# 0.25 day for 30 days ahead and 30 days back. Ascendant sign drawn uniformly; querent A = ruler of the
# rising sign, quesited B = ruler of the opposite sign (house 7, whole-sign). Horizon = until A or B
# changes sign, at most 30 days. Aspects 0/60/90/120/180; "perfects" = exact aspect is crossed.
# Operational definitions (after Lilly 1647, simplified so a program can apply them):
#   direct       A and B perfect within the horizon
#   prohibition  before that, a third body faster than A or B perfects with it (also run without the Moon)
#   frustration  before that, the slower significator perfects with a third, slower body
#   refranation  within 8 degrees and applying now, no perfection, and A or B stations in the horizon
#   translation  no direct; a body faster than both, separating (within 8 deg) from one, perfects with the
#                other before it leaves its own sign
#   collection   no direct; a body slower than both is perfected by A and by B within the horizon
#   reception    A and B in each other's domicile now
import math
import random

ORB = {"Mercury": (252.2503, 87.9691, 0.38710), "Venus": (181.9791, 224.7008, 0.72333),
       "Mars": (355.4466, 686.9796, 1.52371), "Jupiter": (34.3964, 4332.589, 5.20289),
       "Saturn": (49.9542, 10759.22, 9.53668)}
EARTH = (100.4646, 365.2564, 1.0)
BODIES = ["Sun", "Moon", "Mercury", "Venus", "Mars", "Jupiter", "Saturn"]
RULER = ["Mars", "Venus", "Mercury", "Moon", "Sun", "Mercury", "Venus", "Mars", "Jupiter", "Saturn",
         "Saturn", "Jupiter"]
TARGETS = (0, 60, 90, 120, 180, 240, 270, 300)
STEP, K = 0.25, 120
MODES = ["direct", "prohibition", "prohibition_no_moon", "frustration", "refranation", "translation",
         "collection", "reception"]


def helio(el, d):
    lon = math.radians(el[0] + 360.0 * d / el[1])
    return el[2] * math.cos(lon), el[2] * math.sin(lon)


def sky(d):
    ex, ey = helio(EARTH, d)
    m = math.radians(357.529 + 0.98560028 * d)
    pos = {"Sun": (math.degrees(math.atan2(-ey, -ex)) + 1.915 * math.sin(m)) % 360}
    for p, el in ORB.items():
        x, y = helio(el, d)
        pos[p] = math.degrees(math.atan2(y - ey, x - ex)) % 360
    mm = math.radians(134.963 + 13.064993 * d)
    pos["Moon"] = (218.3165 + 13.176396 * d + 6.289 * math.sin(mm)) % 360
    return pos


def gap(a, b, t):
    """Signed distance of the separation a-b from aspect target t, in (-180, 180]."""
    return ((a - b - t + 180) % 360) - 180


def first_perfect(tr, x, y, k0, k1):
    """First step index in (k0, k1] at which x and y cross an exact aspect, else None."""
    for k in range(k0, k1):
        a0, b0, a1, b1 = tr[k][x], tr[k][y], tr[k + 1][x], tr[k + 1][y]
        for t in TARGETS:
            g0, g1 = gap(a0, b0, t), gap(a1, b1, t)
            if g0 == 0 or (g0 * g1 < 0 and abs(g0 - g1) < 90):
                return k + 1
    return None


def near(tr, x, y, k=K):
    """(distance to nearest aspect now, applying?) using the next step."""
    best = min(TARGETS, key=lambda t: abs(gap(tr[k][x], tr[k][y], t)))
    g0, g1 = abs(gap(tr[k][x], tr[k][y], best)), abs(gap(tr[k + 1][x], tr[k + 1][y], best))
    return g0, g1 < g0


def speed(tr, p, k=K):
    return ((tr[k + 1][p] - tr[k][p] + 180) % 360 - 180) / STEP


def leaves_sign(tr, p, k0, k1):
    s = int(tr[k0][p] // 30)
    for k in range(k0 + 1, k1 + 1):
        if int(tr[k][p] // 30) != s:
            return k
    return k1


def judge(d, asc):
    tr = [sky(d + (k - K) * STEP) for k in range(2 * K + 1)]
    a, b = RULER[asc], RULER[(asc + 6) % 12]
    hz = min(leaves_sign(tr, a, K, 2 * K), leaves_sign(tr, b, K, 2 * K))
    out = dict.fromkeys(MODES, False)
    va, vb = abs(speed(tr, a)), abs(speed(tr, b))
    fast, slow = (a, b) if va >= vb else (b, a)
    kab = first_perfect(tr, a, b, K, hz)
    others = [c for c in BODIES if c not in (a, b)]
    if kab is not None:
        out["direct"] = True
        for c in others:
            vc = abs(speed(tr, c))
            for sig, vs in ((a, va), (b, vb)):
                kc = first_perfect(tr, c, sig, K, kab - 1)
                if kc is not None and vc > vs:
                    out["prohibition"] = True
                    if c != "Moon":
                        out["prohibition_no_moon"] = True
            kc = first_perfect(tr, slow, c, K, kab - 1)
            if kc is not None and vc < min(va, vb):
                out["frustration"] = True
    else:
        g, applying = near(tr, a, b)
        if g <= 8 and applying:
            sa = [speed(tr, a, k) for k in range(K, hz)]
            sb = [speed(tr, b, k) for k in range(K, hz)]
            if any(x * sa[0] < 0 for x in sa) or any(x * sb[0] < 0 for x in sb):
                out["refranation"] = True
        for c in others:
            vc = abs(speed(tr, c))
            if vc > va and vc > vb:
                hc = leaves_sign(tr, c, K, 2 * K)
                for s1, s2 in ((a, b), (b, a)):
                    g, app = near(tr, c, s1)
                    if g <= 8 and not app and first_perfect(tr, c, s2, K, hc) is not None:
                        out["translation"] = True
            if vc < va and vc < vb:
                if first_perfect(tr, a, c, K, hz) is not None and first_perfect(tr, b, c, K, hz) is not None:
                    out["collection"] = True
    sa_, sb_ = int(tr[K][a] // 30), int(tr[K][b] // 30)
    out["reception"] = RULER[sa_] == b and RULER[sb_] == a
    return out


if __name__ == "__main__":
    rng = random.Random(73)
    n = 6000
    tally, yes, clean, clean_nm = {}, 0, 0, 0
    for _ in range(n):
        o = judge(rng.uniform(0, 50 * 365.25), rng.randrange(12))
        for k, v in o.items():
            tally[k] = tally.get(k, 0) + v
        c = o["direct"] and not (o["prohibition"] or o["frustration"])
        clean += c
        clean_nm += o["direct"] and not (o["prohibition_no_moon"] or o["frustration"])
        yes += c or o["translation"] or o["collection"]
    print("   {} contract questions (querent = ruler of 1, other party = ruler of 7)".format(n))
    for k in MODES:
        print("     {:19s} {:.4f}".format(k, tally[k] / n))
    print("     direct and not interrupted          {:.4f}".format(clean / n))
    print("     some route to perfection (yes-lean) {:.4f}".format(yes / n))
    print("   uniform-sign reference for reception:")
    print("     Mars-Venus (2/12)*(2/12) = {:.4f}; Moon-Saturn (1/12)*(2/12) = {:.4f}".format(
        4 / 144, 2 / 144))
    print("     direct, interrupted only if the third body is not the Moon: clean share {:.4f}".format(
        clean_nm / n))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《卡巴拉生命灵数、雷诺曼三十六牌组合与古典卜卦占星母典》第 7 章「成局七法与应期九种」(版本 0.1.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026128,
  author    = {Fan, Yafu},
  title     = {The Life-Path, Lenormand-Pair and Horary-Timing Codex},
  year      = {2026},
  publisher = {5D Library},
  edition   = {0.1.0},
  note      = {DOI pending}
}

本书其他章节结论