5D Library › Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs · 中文
Chapter 5. Information, Repeats and the Base Rate of “Something Special”
How many situations can a spread distinguish?
The most information a spread can carry is the base-2 logarithm of the number of layouts that can be told apart. It is an upper bound: it assumes every layout is read as a different meaning.
Calculation
# Chapter 5. p11: How much a spread can say, and how often cards repeat.
# (1) Information: log2 of the number of distinguishable layouts.
# (2) Repeats: two independent 10-card spreads from a full deck share
# S cards, S hypergeometric with mean 100/78. "The same card again"
# is the rule, not the exception.
# (3) Over a run of readings: P(a named card appears at least once in
# r spreads of 10).
from fractions import Fraction
from math import comb, factorial, log2
def bits(n):
return log2(n)
if __name__ == "__main__":
rows = [("3 cards, upright only", 78 * 77 * 76),
("3 cards with reversals", 78 * 77 * 76 * 8),
("Celtic Cross, reversals",
factorial(78) // factorial(68) * 2 ** 10),
("Lenormand Grand Tableau", factorial(36))]
print(" layout bits")
for name, n in rows:
print(" {:24s} {:7.2f}".format(name, bits(n)))
share = [Fraction(comb(10, s) * comb(68, 10 - s), comb(78, 10))
for s in range(11)]
mean = sum(s * p for s, p in enumerate(share))
print("\n two Celtic Crosses: shared cards S")
for s in range(5):
print(" S = {} {:.4f}".format(s, float(share[s])))
print(" E[S] = {:.4f}; P(S >= 1) = {:.4f}; P(S >= 2) = {:.4f}".format(
float(mean), float(1 - share[0]), float(1 - share[0] - share[1])))
print("\n a named card in r spreads of 10:")
for r in (1, 3, 5, 10, 20):
p = 1 - (Fraction(68, 78)) ** r
print(" r = {:2d} P(at least once) = {:.4f}".format(r, float(p)))
one_of_22 = 1 - Fraction(comb(56, 10), comb(78, 10))
print(" P(a Celtic Cross holds at least one major) = {:.4f}".format(
float(one_of_22)))
# layout bits
# 3 cards, upright only 18.80
# 3 cards with reversals 21.80
# Celtic Cross, reversals 71.99
# Lenormand Grand Tableau 138.09
#
# two Celtic Crosses: shared cards S
# S = 0 0.2311
# S = 1 0.3916
# S = 2 0.2644
# S = 3 0.0925
# S = 4 0.0183
# E[S] = 1.2821; P(S >= 1) = 0.7689; P(S >= 2) = 0.3773
#
# a named card in r spreads of 10:
# r = 1 P(at least once) = 0.1282
# r = 3 P(at least once) = 0.3374
# r = 5 P(at least once) = 0.4964
# r = 10 P(at least once) = 0.7464
# r = 20 P(at least once) = 0.9357
# P(a Celtic Cross holds at least one major) = 0.9717A three-card spread without reversals carries about 18.80 bits, with reversals 21.80; a Celtic Cross with reversals 71.99 bits; the 36-card arrangement of a Lenormand Grand Tableau 138.09 bits. Such large numbers mean that “the same spread again” is all but impossible, but not that a reading actually uses so much information. A reading usually compresses the layout into a few features (how many majors, the dominant suit, the positions of a few key cards), and the information actually used is far smaller.
“The same card again”
The number of cards shared by two independent Celtic Crosses is also hypergeometric: ten cards drawn from 78, of which ten “appeared last time”. The expected number shared is 1.2821; at least one card is shared with probability 0.7689, at least two with probability 0.3773. In other words, two successive spreads sharing a card is the rule, not the exception.
For a named card, the probability of appearing at least once in successive ten-card spreads is : 0.4964 for five spreads, 0.7464 for ten and 0.9357 for twenty. A Celtic Cross contains at least one major with probability 0.9717.
Note
The experience of a card “that keeps coming up”. For someone who draws often, a particular card appears within ten spreads with probability about three in four; and among 78 cards there are always a few that have appeared two or three times recently. Those few are noticed; the seventy-odd that did not come back are not remembered.
Multiple comparisons: there is always a feature
A reader looks at many possible “features” of a spread at once. The program takes eight often-mentioned features and computes their base rates on random spreads: F1 four or more majors; F2 four or more of one suit; F3 three or more courts; F4 two or more aces; F5 seven or more, or three or fewer, reversed; F6 a major in the outcome position (card 10); F7 a suit missing; F8 three consecutive pips in one suit.
Calculation
# Chapter 5. p12: Something always stands out - pattern base rates.
# Eight features readers often remark on in a Celtic Cross, each scored
# on random spreads (cards and orientations both random):
# F1 four or more majors F2 one suit four or more times
# F3 three or more courts F4 two or more aces
# F5 7+ or 3- reversed F6 a major in the outcome position (10)
# F7 a suit missing entirely F8 three pips in sequence in one suit
# We report each rate, the expected number of features present and the
# chance that at least one (two, three) is present.
import random
DECK = [("M", i) for i in range(22)] + \
[(s, r) for s in "WCSP" for r in range(1, 15)]
def features(hand, rev):
minors = [c for c in hand if c[0] != "M"]
suits = [sum(c[0] == s for c in minors) for s in "WCSP"]
pips = {(s, r) for s, r in minors if r <= 10}
seq = any((s, r) in pips and (s, r + 1) in pips and (s, r + 2) in pips
for s in "WCSP" for r in range(1, 9))
nrev = sum(rev)
return [len(hand) - len(minors) >= 4, max(suits) >= 4,
sum(r >= 11 for _, r in minors) >= 3,
sum(r == 1 for _, r in minors) >= 2,
nrev >= 7 or nrev <= 3, hand[9][0] == "M",
min(suits) == 0, seq]
if __name__ == "__main__":
rng = random.Random(71012)
T = 200000
hits = [0] * 8
dist = [0] * 9
for _ in range(T):
hand = rng.sample(DECK, 10)
rev = [rng.random() < 0.5 for _ in range(10)]
f = features(hand, rev)
for i, x in enumerate(f):
hits[i] += x
dist[sum(f)] += 1
for i, h in enumerate(hits):
print(" F{} {:.4f}".format(i + 1, h / T))
mean = sum(k * d for k, d in enumerate(dist)) / T
print(" expected features per spread: {:.3f}".format(mean))
for k in (1, 2, 3):
print(" P({} or more features) = {:.4f}".format(
k, sum(dist[k:]) / T))
# F1 0.2952
# F2 0.2865
# F3 0.3331
# F4 0.0783
# F5 0.3449
# F6 0.2838
# F7 0.4346
# F8 0.0469
# expected features per spread: 2.103
# P(1 or more features) = 0.9099
# P(2 or more features) = 0.6741
# P(3 or more features) = 0.3685The base rates of the eight features range from 0.0469 (three in sequence) to 0.4346 (a missing suit); a random spread shows 2.103 of them on average. It shows at least one with probability 0.9099, two or more with probability 0.6741 and three or more with probability 0.3685. A random Celtic Cross, that is, has better than nine chances in ten of “showing something special”, and two chances in three of showing two such things at once.
Evidence
The difference between “a named feature” and “some feature” is a problem of multiple comparisons. A single feature named in advance may have a base rate of around five per cent; picking out afterwards whichever of eight features happened turns the base rate into nine in ten. It is the same point as the “houses” example of Chapter 3.
Hypothesis · not established
The author’s hypothesis (not yet tested): the share of random spreads that readers report as “especially meaningful” rises with the number of the above features a spread shows, and does not depend on whether the spread was drawn by the person concerned. What would show it wrong: if, under blind conditions, readers’ ratings of “meaningfulness” differ consistently between spreads drawn by the person and randomly substituted spreads, and the difference is not explained by the number of features, the hypothesis fails.
Summary
The combinatorial space of a spread is large, but readings use only a few features. Two successive spreads share at least one card with probability about 0.7689; a random spread shows at least one of eight common features with probability 0.9099. These base rates must be acknowledged before the “meaning” of any single spread is discussed.
Fan, Y. (2026). Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs: Reversal Binomial Mixtures, Grand-Tableau Manhattan Distances and Twenty-Two-Edge Spectral Centrality [塔罗超几何抽样、雷诺曼网格拓扑与卡巴拉生命树图论] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090191 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).