What does Human Design, Tzolkin and Tarot Projection conclude, in numbers, about “Wands and Cups: Twenty-Eight Cards of Fire for Action and Water for Ties”?
Answer: This chapter has read the twenty-eight wands and cups. Each minor card is built from two parts: the suit gives the domain (wands action and enterprise, cups feeling and relationship), the rank gives how far the force has travelled, and Waite's picture then separates the same rank in the two suits. Exact enumeration shows that the expected number of wands in a ten-card spread is 1.7949 and three or more occur 0.2531 of the time, so "three wands" is ordinary; the engine favours the earlier element when counts tie, reporting fire as dominant 0.3549 of the time, 2.0679 times earth's 0.1716. Court cards almost always appear: the chance of at least one in ten cards is 1 minus 0.0854. Every card has its structure, upright, reversed, projection and decision rule; the projection paragraph pulls "who is this card about" back from the other person to yourself. The chapter registers two matching tests and gives the sample sizes they need.
Scope of the numbers: All calculations are generated by the book's programs; it is not investment, legal, medical or psychological advice. Marked boxes separate published evidence, runnable Python calculations, classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.1716, 0.2531, 0.3549, 1.7949, 2.0679
| n | 3: expected wands 0.5385, expected cups 0.5385 |
| P(W | 0 ) = 0.5477 |
| P(W > | 3 ) = 0.0048 |
| P(W > | 4 ) = 0.0000 |
| P(W > C ) | 0.3068 |
| P(W = C ) | 0.3865 |
| P(W >= C + 2 ) | 0.0646 |
| P(W | 0 and C = 0 ) = 0.2576 |
| P(W > | 1 and C >= 1 ) = 0.1623 |
| P(W + C > | 5 ) = 0.0000 |
| top suit count shared by two or more suits | 0.5046 |
| engine 'dominant element' (first maximum wins): | |
| fire (wands) | 0.4223 fair share 0.2500, bias +0.1723 |
| water (cups) | 0.2733 fair share 0.2500, bias +0.0233 |
| air (swords) | 0.1805 fair share 0.2500, bias -0.0695 |
| earth (pentacles) | 0.1238 fair share 0.2500, bias -0.1262 |
| n | 10: expected wands 1.7949, expected cups 1.7949 |
| P(W | 0 ) = 0.1204 |
| P(W > | 3 ) = 0.2531 |
| P(W > | 4 ) = 0.0734 |
| P(W > C ) | 0.3892 |
| P(W = C ) | 0.2216 |
| P(W >= C + 2 ) | 0.1987 |
| P(W | 0 and C = 0 ) = 0.0082 |
| P(W > | 1 and C >= 1 ) = 0.7674 |
| P(W + C > | 5 ) = 0.2562 |
| top suit count shared by two or more suits | 0.3136 |
| engine 'dominant element' (first maximum wins): |
Show the full program
# Chapter 6. p30: Fire against water - how many wands and cups a spread holds, and the engine's tie rule.
# The deck: 22 majors and four suits of 14 (wands = fire, cups = water, swords = air,
# pentacles = earth). A spread of n cards is dealt without replacement, so the counts
# (W, C, S, P, M) are multivariate hypergeometric:
# P = C(14,W) C(14,C) C(14,S) C(14,P) C(22,M) / C(78,n), W + C + S + P + M = n.
# We enumerate every count vector exactly. The engine (fleet1_west.tarot_compute) names a
# "dominant element" with Python's max() over the order fire, water, air, earth; max()
# keeps the FIRST of several equal counts, so every tie is resolved toward fire and away
# from earth, and a spread with no minor card at all is reported as fire.
from fractions import Fraction
from math import comb
SUIT, MAJ, DECK = 14, 22, 78
NAMES = ["fire (wands)", "water (cups)", "air (swords)", "earth (pentacles)"]
def vectors(n):
for w in range(n + 1):
for c in range(n + 1 - w):
for s in range(n + 1 - w - c):
for p in range(n + 1 - w - c - s):
m = n - w - c - s - p
num = comb(SUIT, w) * comb(SUIT, c) * comb(SUIT, s) * comb(SUIT, p) * comb(MAJ, m)
yield (w, c, s, p), Fraction(num, comb(DECK, n))
def report(n):
dom, tie, ev = [Fraction(0)] * 4, Fraction(0), {}
for v, pr in vectors(n):
top = max(v)
dom[v.index(top)] += pr
if v.count(top) > 1:
tie += pr
for name, cond in (("W = 0", v[0] == 0), ("W >= 3", v[0] >= 3), ("W >= 4", v[0] >= 4),
("W > C", v[0] > v[1]), ("W = C", v[0] == v[1]), ("W >= C + 2", v[0] >= v[1] + 2),
("W = 0 and C = 0", v[0] == 0 and v[1] == 0), ("W >= 1 and C >= 1", v[0] and v[1]),
("W + C >= 5", v[0] + v[1] >= 5)):
ev[name] = ev.get(name, Fraction(0)) + (pr if cond else 0)
print(" n = {}: expected wands {:.4f}, expected cups {:.4f}".format(n, n * SUIT / DECK, n * SUIT / DECK))
for name, pr in ev.items():
print(" P({:18s}) = {:.4f}".format(name, float(pr)))
print(" top suit count shared by two or more suits: {:.4f}".format(float(tie)))
print(" engine 'dominant element' (first maximum wins):")
for i in range(4):
print(" {:18s} {:.4f} fair share 0.2500, bias {:+.4f}".format(NAMES[i], float(dom[i]), float(dom[i]) - 0.25))
return dom
if __name__ == "__main__":
report(3)
print()
d = report(10)
print("\n fire is named {:.4f} times as often as earth by the tie rule alone".format(float(d[0] / d[3])))Single source and citation
Fan, Y. (2026). The Human Design, Tzolkin and Seventy-Eight Tarot Projection Codex (Version 1.0.0), Chapter 6: Wands and Cups: Twenty-Eight Cards of Fire for Action and Water for Ties. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 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}
}Other chapter answers in this book
- Chapter 1 · Method: The Gate Wheel, the 260 Days and the 78 Cards
- Chapter 2 · The Thirty-Six Channels: Fixed Lines of Energy Once Two Gates Connect
- Chapter 3 · Nine Centres, Five Types and Twelve Profiles
- Chapter 4 · Twenty Seals and Thirteen Tones: One Table, Two Ways of Counting
- Chapter 5 · The Twenty-Two Majors: Upright, Reversed and Projected
- Chapter 7 · Swords and Pentacles: Twenty-Eight Cards of Air for Judgement and Earth for Money
- Chapter 8 · Practice: Sample Chart A Through the Station, Three Cards, and a Blind-Matching Test with Barnum Controls