What does Liuyao Multiple Motion, Hidden Spirits and Timing conclude, in numbers, about “Method: Three Coins, the Month and the Day, and the Definitions the Whole Book Shares”?
Answer: Chapter 1 finds that casts with two or more moving lines take 0.4661 and a lone still line only 0.0044; a clash has a single route, Kun and Xun changing into each other with the middle and top lines moving, so one moving line never clashes, only 0.0312 of all moving lines turn into a clash, and casts with a clash are 0.0233; of still lines struck by the day, hidden motion takes 0.0347 and day break 0.0486, and the two never share a cast; only 0.3125 of the 64 hexagrams carry all five relations, and two of the twenty hidden-flying pairs never occur; a cast switches on 2.9642 entries on average, and only 0.0090 switch on none.
Scope of the numbers: All calculations are generated by the programs printed in the book; it is not investment, legal, psychological or marital 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. printed values that match the answer: 0.0044, 0.0233, 0.0312
| k P(k) clash/line comb/line P(cast has a clash) | |
| 1 | 0.3560 0.0000 0.0833 0.0000 |
| 2 | 0.2966 0.0333 0.0500 0.0333 |
| 3 | 0.1318 0.0500 0.0500 0.0750 |
| 4 | 0.0330 0.0500 0.0833 0.0958 |
| 5 | 0.0044 0.0333 0.1500 0.0833 |
| 6 | 0.0002 0.0000 0.2500 0.0000 |
| all moving lines: clash 0.0312, combination 0.0625 | |
| casts with a clash | 0.0233 of all casts, 0.0283 of moving casts |
| single moving line, 384 cases | 32 combine, 0 clash |
| moving lines in its trigram clash combination | |
| 1 | 0.0000 0.0833 |
| 2 | 0.0833 0.0000 |
| 3 | 0.0000 0.2500 |
| every clash comes from: Kun -> Xun, trigram lines (2, 3) moving; Xun -> Kun, trigram lines (2, 3) moving |
Show the full program
# Chapter 1. p02: Clash and combination between a moving line and its change.
# Najia (Jing Fang): a trigram starts at a fixed branch and steps +2
# (yang trigrams Qian Zhen Kan Gen) or -2 (yin trigrams Kun Xun Li Dui);
# the outer trigram starts six branches later. A moving line takes the
# branch the changed hexagram puts on the same line. Shared definitions:
# into clash = the changed branch is six branches from the original
# (zi-wu, chou-wei, ...); into combination = the pair is one of the six
# harmonies zi-chou, yin-hai, mao-xu, chen-you, si-shen, wu-wei, i.e.
# (original + changed) mod 12 = 1. Every original hexagram (64) and
# every non-empty set of moving lines (63) is weighted by its three-coin
# probability (1/64) (1/4)^k (3/4)^(6-k). Shares are of moving lines.
START = {(1, 1, 1): 0, (1, 0, 0): 0, (0, 1, 0): 2, (0, 0, 1): 4,
(0, 0, 0): 7, (0, 1, 1): 1, (1, 0, 1): 3, (1, 1, 0): 5}
YANG = {(1, 1, 1), (1, 0, 0), (0, 1, 0), (0, 0, 1)}
NAME = {(1, 1, 1): "Qian", (1, 0, 0): "Zhen", (0, 1, 0): "Kan", (0, 0, 1): "Gen",
(0, 0, 0): "Kun", (0, 1, 1): "Xun", (1, 0, 1): "Li", (1, 1, 0): "Dui"}
def najia(h):
out = []
for t, base in ((h[:3], 0), (h[3:], 6)):
step = 2 if t in YANG else -2
out += [(START[t] + base + step * j) % 12 for j in range(3)]
return out
if __name__ == "__main__":
by_k = {k: [0.0, 0.0, 0.0, 0.0, 0] for k in range(1, 7)}
by_t = {j: [0.0, 0.0, 0.0] for j in (1, 2, 3)}
routes = set()
for code in range(64):
h = tuple((code >> i) & 1 for i in range(6))
o = najia(h)
for mask in range(1, 64):
mv = [i for i in range(6) if mask >> i & 1]
k = len(mv)
w = 0.25 ** k * 0.75 ** (6 - k) / 64
c = najia(tuple(b ^ (i in mv) for i, b in enumerate(h)))
cl = [i for i in mv if (c[i] - o[i]) % 12 == 6]
co = [i for i in mv if (c[i] + o[i]) % 12 == 1]
for i in cl:
t = i // 3 * 3
routes.add((NAME[h[t:t + 3]], NAME[tuple(b ^ (x in mv) for x, b
in enumerate(h))[t:t + 3]], tuple(x % 3 + 1 for x
in mv if x // 3 == i // 3)))
row = by_k[k]
row[0] += w * k
row[1] += w * len(cl)
row[2] += w * len(co)
row[3] += w * bool(cl)
if k == 1:
row[4] += len(co)
for i in mv:
j = sum(1 for x in mv if x // 3 == i // 3)
by_t[j][0] += w
by_t[j][1] += w * (i in cl)
by_t[j][2] += w * (i in co)
print(" k P(k) clash/line comb/line P(cast has a clash)")
tot = [0.0, 0.0, 0.0, 0.0]
for k, r in by_k.items():
pk = r[0] / k
print(" {} {:.4f} {:.4f} {:.4f} {:.4f}".format(
k, pk, r[1] / r[0], r[2] / r[0], r[3] / pk))
tot = [tot[0] + r[0], tot[1] + r[1], tot[2] + r[2], tot[3] + r[3]]
print(" all moving lines: clash {:.4f}, combination {:.4f}".format(
tot[1] / tot[0], tot[2] / tot[0]))
print(" casts with a clash: {:.4f} of all casts, {:.4f} of moving"
" casts".format(tot[3], tot[3] / (1 - 0.75 ** 6)))
print(" single moving line, 384 cases: {} combine, 0 clash".format(
by_k[1][4]))
print(" moving lines in its trigram clash combination")
for j, r in by_t.items():
print(" {} {:.4f} {:.4f}".format(
j, r[1] / r[0], r[2] / r[0]))
print(" every clash comes from: " + "; ".join(
"{} -> {}, trigram lines {} moving".format(a, b, l)
for a, b, l in sorted(routes)))Single source and citation
Fan, Y. (2026). The Liuyao Codex of Multiple Moving Lines, Hidden Motion, Hidden Spirits and Timing (Version 1.0.0), Chapter 1: Method: Three Coins, the Month and the Day, and the Definitions the Whole Book Shares. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-125 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026125,
author = {Fan, Yafu},
title = {The Liuyao Codex of Multiple Moving Lines, Hidden Motion, Hidden Spirits and Timing},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 2 · Several Lines Moving: Clash, Combine, Lone Mover and Lone Still Line
- Chapter 3 · Hidden Motion and Day Break: Still Lines Stirred by the Day
- Chapter 4 · Flying and Hidden Spirits: Twenty Cells of What Is Missing and What Sits on It
- Chapter 5 · Void at Rest and Void in Motion: Twelve Cells of What Is Absent and What Is on Its Way
- Chapter 6 · Twelve Timing Rules: the State of the Key Line and the Day It Lands
- Chapter 7 · Four Casts Read Through: Several Lines Moving, from Layout to Landing Day
- Chapter 8 · Practice: One Cast with Three Moving Lines, the Ten Entries It Switches On, Its Timing, and a Pre-registered Forecasting Test