5D Library › Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs · 中文

Chapter 3. The Grid Combinatorics of the Lenormand Grand Tableau

Thirty-six cards and two Grand Tableaux

The Lenormand deck has 36 cards whose numbering and pictures follow the card game Das Spiel der Hoffnung (“The Game of Hope”), published in Nuremberg around 1799 (Hechtel 1799). A “Grand Tableau” lays out all 36 cards: either 4 rows of 9 (9×49 \times 4) or 4 rows of 8 with 4 more in the middle below (8×4+48 \times 4 + 4). The reader first finds the significator (card 28, the Gentleman, or 29, the Lady, for instance) and then looks at where the other key cards lie relative to it: touching or not, how far away, in the same row or column, a knight’s move away, in a mirrored position.

A well-shuffled Grand Tableau is a uniformly random permutation in S36S_{36}, so any two named cards occupy a uniformly random pair of distinct cells. The 9×49 \times 4 grid has 36 cells and 1260 ordered pairs of cells; every probability below is an exact count over those 1260 pairs.

Calculation

# 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()))))
#    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}

Base rates of distance and adjacency

The expected Manhattan distance between two named cards is exactly 13/3; the most common distance is 3 (0.1698), and distance 1 has probability 0.0937. Touching in eight directions (one step of a chess king) has probability 0.1698, about one in six. The same row has probability 0.2286, far above the same column at 0.0857, because a row has 9 cells and a column only 4. A knight’s move has probability 0.1175, and mirroring (reflection in the middle column, the middle row or both) 0.0794.

Taken together, “some spatial relation worth mentioning” between a key card and the significator is close to certain: touching, same row, same column, knight’s move and mirroring each already have base rates between a tenth and a fifth, and readers usually look at several key cards at once.

Exact law of the Manhattan distance between two named cards in the 9 \times 4 Grand Tableau (p06).

The base rate of touching also depends on where the significator lands: the four corner cells have 3 neighbours, the 18 edge cells 5, and the 14 interior cells 8.

The other layout, and the “houses”

Calculation

# Chapter 3. p07: The 8 x 4 + 4 layout, and cards in their own house.
# Layout B: four rows of 8, plus a row of 4 under the middle columns
# (columns 2-5). Position k (1..36, read row by row) is "house k" and
# carries the meaning of card k. A card in its own house is a fixed point
# of the random permutation; their number has an exact law (derangements)
# close to Poisson(1). We also count how many cards touch the
# significator, averaged over where it lands.
from fractions import Fraction
from itertools import permutations
from math import comb, exp, factorial

def layout_a():
    return [(r, c) for r in range(4) for c in range(9)]

def layout_b():
    return [(r, c) for r in range(4) for c in range(8)] + \
           [(4, c) for c in range(2, 6)]

def touching(a, b):
    return max(abs(a[0] - b[0]), abs(a[1] - b[1])) == 1

def derange(n):
    d = [1, 0]                      # D(n) = (n - 1)(D(n-1) + D(n-2))
    for m in range(2, n + 1):
        d.append((m - 1) * (d[-1] + d[-2]))
    return d[n]

def summary(name, cells):
    pairs = list(permutations(cells, 2))
    t = sum(touching(a, b) for a, b in pairs)
    d = sum(abs(a[0] - b[0]) + abs(a[1] - b[1]) for a, b in pairs)
    print("   {}: P(touching) = {:.4f}, E[Manhattan] = {:.4f}".format(
        name, t / len(pairs), d / len(pairs)))
    print("              mean neighbours per cell {:.3f}".format(
        t / len(cells)))

if __name__ == "__main__":
    summary("9 x 4    ", layout_a())
    summary("8 x 4 + 4", layout_b())
    n = 36
    print("\n   own-house cards among 36 (exact vs Poisson(1)):")
    for k in range(6):
        p = Fraction(comb(n, k) * derange(n - k), factorial(n))
        print("     k = {}  {:.5f}  {:.5f}".format(
            k, float(p), exp(-1) / factorial(k)))
    p0 = Fraction(derange(n), factorial(n))
    print("   P(at least one card in its own house) = {:.5f}".format(
        1 - float(p0)))
    print("   P(significator 28 in house 28) = 1/36 = {:.5f}".format(1 / 36))
#    9 x 4    : P(touching) = 0.1698, E[Manhattan] = 4.3333
#               mean neighbours per cell 5.944
#    8 x 4 + 4: P(touching) = 0.1730, E[Manhattan] = 4.1048
#               mean neighbours per cell 6.056
#
#    own-house cards among 36 (exact vs Poisson(1)):
#      k = 0  0.36788  0.36788
#      k = 1  0.36788  0.36788
#      k = 2  0.18394  0.18394
#      k = 3  0.06131  0.06131
#      k = 4  0.01533  0.01533
#      k = 5  0.00307  0.00307
#    P(at least one card in its own house) = 0.63212
#    P(significator 28 in house 28) = 1/36 = 0.02778

The 8×4+48 \times 4 + 4 layout puts the last 4 cards under the middle four columns. The mean number of neighbours per cell rises from 5.944 to 6.056, the probability of touching from 0.1698 to 0.1730, and the mean Manhattan distance falls from 4.3333 to 4.1048. The difference is small, but it shows that the base rate of “touching” is not a constant: it is a function of the layout.

Another reading of the Grand Tableau uses “houses”: position kk is the house of card kk. A card in its own house is a fixed point of the random permutation. The exact law of the number of fixed points, given by derangement numbers, agrees with the Poisson law of mean 1 to five decimal places: none and exactly one each have probability 0.36788, and at least one card in its own house has probability 0.63212. A named card (card 28, say) lands in its own house with probability only 1/36, that is 0.02778, but “some card in its own house” happens nearly two times in three.

Note

A named event and “some” event. The base rate of “this card in its own house” is 0.02778; that of “a card in its own house” is 0.63212. Picking out after the fact the one that happened and judging it by the base rate of a named event inflates the base rate more than twentyfold. Chapter 5 extends the point to a whole spread.

Summary

A Grand Tableau is a uniformly random permutation on a grid. Two named cards touch with probability about one in six, share a row about one time in five and lie a knight’s move apart about one time in ten, with mean Manhattan distance 13/3; these base rates change with the layout and the position of the significator. At least one card lands in its own house with probability 0.63212.

References

Hechtel, Johann Kaspar. 1799. Das Spiel Der Hoffnung. Card game of 36 illustrated cards, published by G. P. J. Bieling, Nuremberg.

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).