What does Liuyao Multiple Motion, Hidden Spirits and Timing conclude, in numbers, about “Twelve Timing Rules: the State of the Key Line and the Day It Lands”?

Answer: Before timing, settle four things: which line is the key line, strong or weak, void or not, moving or still. Each of the twelve rules is triggered by one state of the key line and fulfilled by one branch: a prosperous line meets its own branch, a bound line meets its clash, a scattered line meets its combination, a strong void waits to be clashed, a weak void waits to be filled, a moving void waits to leave the xun, a line in its tomb waits for the tomb to be clashed, an excessive line waits to enter its tomb, a weak line waits for birth or peak, a cut-off line waits for its birth branch, a still strong line waits to be clashed, a moving line waits to be combined. p30 shows that the twelve rules cover every case, with 1.8307 rules applying to a key line on average, birth and peak (0.3713) most often. p31 shows that the call chosen by "remove the obstacle first, then take the nearest day" comes 4.35 days after the cast on average, and that a day within 12 days is always available, a property of the branch cycle and no evidence of a hit; what deserves testing is whether, in the 0.3690 of casts where candidate days conflict, the choice rule beats simply taking the earliest day. p32 converts stem-branch days into calendar dates, and Chapter 7 uses it to date four actual casts.

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.3690, 12, 4.35

FengZhimean wait6.60 days, max 12
FengChongmean wait6.08 days, max 12
FengHemean wait6.09 days, max 12
ChongKongmean wait6.60 days, max 12
TianShimean wait6.00 days, max 11
ChuKongmean wait6.00 days, max 11
ChuMumean wait6.10 days, max 12
RuMumean wait7.19 days, max 12
ShengWang mean wait 3.98 days, max 8
JueShengmean wait3.86 days, max 12
JingChongmean wait6.00 days, max 11
DongHemean wait6.47 days, max 12
obstacle present 0.4324, absent 0.5676
rule supplies the call: FengZhi 0.1128, FengChong 0.0909, FengHe 0.0302, ChongKong 0.0484, TianShi 0.0563, ChuKong 0.0289, ChuMu 0.0900, RuMu 0.0485, ShengWang 0.3102, JueSheng 0.0982, JingChong 0.0648, DongHe 0.0528
mean wait of the call: 4.35 days
call within 6 days 0.8128, within 12 days 1.0000
candidates of the deciding group name two or more different days: 0.3690
Show the full program
# Chapter 6. p31: How long each timing rule makes you wait, and the call.
# Same line states, weights and rules as p30. Each rule names one or two
# fulfilling branches: FengZhi, TianShi b; FengChong, ChongKong, JingChong
# the branch clashing b; FengHe, DongHe the branch combining b; ChuKong b or
# its clash, but only after the current xun ends; ChuMu the clash of the
# tomb; RuMu the tomb; ShengWang the birth or peak branch; JueSheng the birth
# branch. Wait = days from the cast day to the first such day (1 to 12).
# The call: if any obstacle rule applies (ChongKong TianShi ChuKong ChuMu
# JueSheng FengHe FengChong), the call is the earliest day among them;
# otherwise it is the earliest day among the other five rules (FengZhi RuMu
# ShengWang JingChong DongHe). "Supplies" counts every rule that names it.
BEL = (4, 2, 0, 0, 2, 1, 1, 2, 3, 3, 2, 4)
TOMB, JUE = (7, 10, 4, 1, 4), (8, 11, 5, 2, 5)
TRI = ((0, 0, 0), (1, 0, 0), (0, 1, 0), (1, 1, 0), (0, 0, 1), (1, 0, 1),
       (0, 1, 1), (1, 1, 1))                 # Kun Zhen Kan Dui Gen Li Xun Qian
START = (7, 0, 2, 5, 4, 3, 1, 0)
YANG = (0, 1, 1, 0, 1, 0, 0, 1)
NAMES = ("FengZhi", "FengChong", "FengHe", "ChongKong", "TianShi", "ChuKong",
         "ChuMu", "RuMu", "ShengWang", "JueSheng", "JingChong", "DongHe")

def najia(h):
    out = []
    for t, base in ((TRI.index(h[:3]), 0), (TRI.index(h[3:]), 6)):
        step = 2 if YANG[t] else -2
        out += [(START[t] + base + step * k) % 12 for k in range(3)]
    return out

def states():
    acc = {}
    for code in range(4096):
        v = [(6, 7, 8, 9)[(code >> (2 * i)) & 3] for i in range(6)]
        w = 1
        for x in v:
            w *= 1 if x in (6, 9) else 3
        h = tuple(int(x in (7, 9)) for x in v)
        ch = tuple(b ^ (x in (6, 9)) for b, x in zip(h, v))
        o, c = najia(h), najia(ch)
        for i in range(6):
            k = (o[i], v[i] in (6, 9), c[i] if v[i] in (6, 9) else None)
            acc[k] = acc.get(k, 0) + w
    return acc

def rules(b, mv, c, day, mon):
    e, d, me = BEL[b], day % 12, BEL[mon]
    p = e in (me, (me + 1) % 5)
    first = (day % 12 - day % 10 + 10) % 12
    v = b in (first, (first + 1) % 12)
    clash, comb = (d - b) % 12 == 6, (d + b) % 12 == 1
    hc = mv and (c - b) % 12 == 6
    tomb = d == TOMB[e] or (mv and c == TOMB[e])
    jue = d == JUE[e] or (mv and c == JUE[e])
    po = not mv and clash and not p
    return (not v and p, comb or (mv and (c + b) % 12 == 1), hc or po,
            not mv and v and p, not mv and v and not p, mv and v, tomb,
            not v and p and BEL[d] in (e, (e - 1) % 5),
            not v and not p and not tomb and not jue and not po, jue,
            not mv and not v and p and not clash and not comb,
            (mv or (not mv and clash and p)) and not v and not hc)

BIRTH, PEAK = (11, 2, 8, 5, 8), (3, 6, 0, 9, 0)
TIER = (2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 2)

def fulfil(i, b):
    e = BEL[b]
    return ((b,), ((b + 6) % 12,), ((1 - b) % 12,), ((b + 6) % 12,), (b,),
            (b, (b + 6) % 12), ((TOMB[e] + 6) % 12,), (TOMB[e],),
            (BIRTH[e], PEAK[e]), (BIRTH[e],), ((b + 6) % 12,),
            ((1 - b) % 12,))[i]

def wait(i, b, day):
    t = 10 - day % 10 if i == 5 else 1
    while (day + t) % 12 not in fulfil(i, b):
        t += 1
    return t

if __name__ == "__main__":
    s, n, mx = [0] * 12, [0] * 12, [0] * 12
    tier, call, split, total, sup = [0] * 3, {}, 0, 0, [0] * 12
    for (b, mv, c), w in states().items():
        for day in range(60):
            for mon in range(12):
                r = rules(b, mv, c, day, mon)
                ws = {}
                for i in range(12):
                    if r[i]:
                        t = wait(i, b, day)
                        s[i] += w * t
                        n[i] += w
                        mx[i] = max(mx[i], t)
                        ws.setdefault(TIER[i], {})[i] = t
                top = min(ws)
                tier[top] += w
                d = min(ws[top].values())
                call[d] = call.get(d, 0) + w
                split += w * (len(set(ws[top].values())) > 1)
                for i, t in ws[top].items():
                    sup[i] += w * (t == d)
                total += w
    for i in range(12):
        print("   {:10s} mean wait {:5.2f} days, max {:2d}".format(
            NAMES[i], s[i] / n[i], mx[i]))
    print("   obstacle present {:.4f}, absent {:.4f}".format(
        tier[1] / total, tier[2] / total))
    print("   rule supplies the call: " + ", ".join("{} {:.4f}".format(
        NAMES[i], sup[i] / total) for i in range(12)))
    print("   mean wait of the call: {:.2f} days".format(
        sum(d * w for d, w in call.items()) / total))
    print("   call within 6 days {:.4f}, within 12 days {:.4f}".format(
        sum(w for d, w in call.items() if d <= 6) / total,
        sum(w for d, w in call.items() if d <= 12) / total))
    print("   candidates of the deciding group name two or more different "
          "days: {:.4f}".format(split / total))

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 6: Twelve Timing Rules: the State of the Key Line and the Day It Lands. 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