关于「宝剑与星币:判断之风与金钱之土的二十八张」,《人类图、卓尔金历与塔罗投射》给出的定量结论是什么?

结论:本章读完了宝剑与星币二十八张。宝剑把力落在判断上,越往后越容易变成困住自己的念头;星币把力落在钱、货、手艺与身体上,慢而诚实。精确计算表明,十张牌阵里至少有一个位阶重复出现的情形占 0.7519,宝剑与星币同位阶相遇占 0.1967,所以「同数字」本身不是征兆;逆向的多少取决于洗牌习惯,同样用净极性速断,「可以推」在二分之一模型下是 0.2137,在三分之一模型下是 0.4381。每一张牌都写了结构、正向、逆向、投射与决策规则。本章登记了一项正逆两段文字的盲评检验,带一组对照,并给出了所需的抽牌次数。

数据口径:全部计算由书中程序生成;本书不是投资、法律、医疗或心理建议。 书中以标注框区分已发表的证据、可运行的 Python 计算、原典与作者的假说。

English version

对照数据表

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

10-card spreads, largest number of cards sharing one minor rank:
max0: 0.0000
max1: 0.2481
max2: 0.6708
max3: 0.0790
max4: 0.0021
some rank appears 2 or more times0.7519
some rank appears 3 or more times0.0811
some rank appears 4 or more times0.0021
expected number of same-rank pairs (any two suits)1.2587
a sword and a pentacle of the same rank both present0.1967
expected number of such sword-pentacle rank matches0.2098
3-card spread: at least one sword 0.4523; exactly one sword, one pentacle, one other 0.1288
查看完整验算程序
# Chapter 7. p35: Repeated ranks across suits, and swords meeting pentacles of the same rank.
# The 56 minors form 14 rank classes (ace, two, ..., ten, page, knight, queen, king) of 4
# cards each, one per suit; the 22 majors form one more block. Readers make much of a
# "repeat": two fives, three knights. We count exactly, by dynamic programming over the
# 14 classes, how many 10-card subsets of the 78 have some rank at least twice (or three or
# four times). A second count treats each (swords r, pentacles r) as a two-card class with
# 50 other cards, to ask how often a sword and a pentacle of the SAME rank meet, which
# chapter 7 reads as thought and money pulling on the same question.
from fractions import Fraction
from math import comb

def subsets_with_max(classes, size, other, n):
    """dp[t][m] = number of ways to take t cards from the classes with largest multiplicity m."""
    dp = {(0, 0): 1}
    for _ in range(classes):
        new = {}
        for (t, m), ways in dp.items():
            for j in range(size + 1):
                if t + j <= n:
                    key = (t + j, max(m, j))
                    new[key] = new.get(key, 0) + ways * comb(size, j)
        dp = new
    out = {}
    for (t, m), ways in dp.items():
        out[m] = out.get(m, 0) + ways * comb(other, n - t)
    return out

if __name__ == "__main__":
    n, total = 10, comb(78, 10)
    by_max = subsets_with_max(14, 4, 22, n)
    print("   10-card spreads, largest number of cards sharing one minor rank:")
    for m in sorted(by_max):
        print("     max = {}: {:.4f}".format(m, by_max[m] / total))
    for k in (2, 3, 4):
        print("   some rank appears {} or more times: {:.4f}".format(k, sum(v for m, v in by_max.items() if m >= k) / total))
    pair_e = Fraction(14 * comb(4, 2) * comb(76, 8), total)
    print("   expected number of same-rank pairs (any two suits): {:.4f}".format(float(pair_e)))
    sp = subsets_with_max(14, 2, 50, n)
    hit = sum(v for m, v in sp.items() if m == 2) / total
    print("   a sword and a pentacle of the same rank both present: {:.4f}".format(hit))
    print("   expected number of such sword-pentacle rank matches: {:.4f}".format(14 * comb(76, 8) / total))
    s1 = 1 - Fraction(comb(64, 3), comb(78, 3))
    s2 = Fraction(comb(14, 1) * comb(14, 1) * comb(50, 1), comb(78, 3))
    print("   3-card spread: at least one sword {:.4f}; exactly one sword, one pentacle, one other {:.4f}".format(
        float(s1), float(s2)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《人类图通道、玛雅卓尔金历与七十八塔罗投射母典》第 7 章「宝剑与星币:判断之风与金钱之土的二十八张」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026126,
  author    = {Fan, Yafu},
  title     = {The Human Design, Tzolkin and Seventy-Eight Tarot Projection Codex},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论