关于「雷诺曼大桌阵的网格组合学」,《塔罗、雷诺曼与生命树的数学》给出的定量结论是什么?
结论:第三章给出雷诺曼大桌阵上的精确基率:两张指定的牌在 9 × 4 网格上相邻的概率为 0.1698,平均曼哈顿距离为 13/3,至少一张牌落在本宫的概率为 0.63212。
数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.1698, 13
| ordered pairs of distinct cells | 1260 |
| Manhattan distance law: | |
| d | 1 118/1260 0.0937 |
| d | 2 188/1260 0.1492 |
| d | 3 214/1260 0.1698 |
| d | 4 200/1260 0.1587 |
| d | 5 168/1260 0.1333 |
| d | 6 136/1260 0.1079 |
| d | 7 104/1260 0.0825 |
| d | 8 72/1260 0.0571 |
| d | 9 40/1260 0.0317 |
| d | 10 16/1260 0.0127 |
| d | 11 4/1260 0.0032 |
| E[d] | 13/3 = 4.3333 |
| P(touching ) | 214/1260 = 0.1698 |
| P(same row ) | 288/1260 = 0.2286 |
| P(same column) | 108/1260 = 0.0857 |
| P(knight ) | 148/1260 = 0.1175 |
| P(mirror ) | 100/1260 = 0.0794 |
| neighbours of a cell (cells with that many): {3 | 4, 5: 18, 8: 14} |
查看完整验算程序
# Chapter 3. p06: Distances in the 9 x 4 Grand Tableau.
# 36 cards in a random order fill 4 rows of 9. Two named cards (say the
# significator 28 and a key card) then occupy a uniformly random pair of
# distinct cells. We list the exact laws of their Manhattan distance and
# of the relations readers use: touching (8 directions, a king's move),
# same row, same column, a knight's move, and mirroring (reflection in
# the middle column, the middle line, or both).
from fractions import Fraction
from itertools import permutations
R, C = 4, 9
CELLS = [(r, c) for r in range(R) for c in range(C)]
def relations(a, b):
dr, dc = abs(a[0] - b[0]), abs(a[1] - b[1])
return {
"touching": max(dr, dc) == 1,
"same row": dr == 0,
"same column": dc == 0,
"knight": {dr, dc} == {1, 2},
"mirror": b in ((a[0], C - 1 - a[1]), (R - 1 - a[0], a[1]),
(R - 1 - a[0], C - 1 - a[1])) and b != a,
}
if __name__ == "__main__":
pairs = list(permutations(CELLS, 2))
tot = len(pairs)
print(" ordered pairs of distinct cells: {}".format(tot))
law = {}
for a, b in pairs:
d = abs(a[0] - b[0]) + abs(a[1] - b[1])
law[d] = law.get(d, 0) + 1
print(" Manhattan distance law:")
for d in sorted(law):
print(" d = {:2d} {:3d}/{} {:.4f}".format(
d, law[d], tot, law[d] / tot))
mean = Fraction(sum(d * n for d, n in law.items()), tot)
print(" E[d] = {} = {:.4f}".format(mean, float(mean)))
for key in ("touching", "same row", "same column", "knight", "mirror"):
n = sum(relations(a, b)[key] for a, b in pairs)
print(" P({:11s}) = {:4d}/{} = {:.4f}".format(key, n, tot, n / tot))
nb = {}
for a in CELLS:
k = sum(relations(a, b)["touching"] for b in CELLS if b != a)
nb[k] = nb.get(k, 0) + 1
print(" neighbours of a cell (cells with that many): {}".format(
dict(sorted(nb.items()))))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《塔罗超几何抽样、雷诺曼网格拓扑与卡巴拉生命树图论》第 3 章「雷诺曼大桌阵的网格组合学」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090191
DOI: 10.5281/zenodo.24090191 · 阅读本章所在专著 · 5DL-B-071 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026071,
author = {Fan, Yafu},
title = {Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090191},
url = {https://doi.org/10.5281/zenodo.24090191}
}