What does Rotating Qimen and Liuyao Business Verdicts conclude, in numbers, about “Six-Line Najia: Forty-Eight Cells of Relation and Move”?

Answer: Casting is a fixed piece of arithmetic: najia assigns branches by two-step strides, forward for yang trigrams and backward for yin ones; the eight palaces divide the hexagrams by eight masks; the six relations are the difference between line element and palace element modulo 5. Each of the eight moves has an exact rule, and one moving line may satisfy several. Because yang trigrams carry only yang branches and yin trigrams only yin branches, a single moving line produces just 48 kinds of branch change, only four of the eight advancing pairs are reachable, and a clash needs two or more moving lines. Over the 23040 single-moving-line cases, turning back to control (0.2292) is the most common and the tomb (0.0625) the rarest; among the forty-eight cells the Officer turning back to control (0.0625) is the largest. A time cast reaches only 192 of the 384 combinations of hexagram and moving line, and Siblings turning into cutting-off and every clash cell can never be produced by it. The verdicts of the forty-eight cells are interpretations, and the chapter gives one pre-registrable test.

Scope of the numbers: 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.0625, 0.2292, 23040

cases: 23040
JinShen19200.0833
TuiShen19200.0833
HuiSheng43200.1875
HuiKe52800.2292
HuaKong38400.1667
HuaMu14400.0625
HuaJue28800.1250
HuaChong00.0000
combinations of moves on one line:
68000.2951(none)
32000.1389HuiKe
28000.1215HuiSheng
16000.0694TuiShen
13600.0590HuaKong
12000.0521JinShen
8000.0347HuiSheng+HuaJue
8000.0347HuaJue
8000.0347HuiKe+HuaJue
6400.0278HuiKe+HuaKong
5600.0243HuiSheng+HuaKong
4000.0174HuaMu
4000.0174JinShen+HuaMu
4000.0174HuiKe+HuaMu
3200.0139TuiShen+HuaKong
2400.0104JinShen+HuaKong
1600.0069HuiSheng+HuaKong+HuaJue
1600.0069HuaKong+HuaJue
Show the full program
# Chapter 7. p37: How often each of the eight moves occurs for one moving line.
# Enumerate 64 hexagrams x 6 moving lines x 60 days = 23040 equally weighted
# cases (najia as in p35). Original branch o, changed branch c:
#   JinShen  (o, c) an advance pair      TuiShen  (c, o) an advance pair
#   HuiSheng element(c) generates o      HuiKe    element(c) controls o
#   HuaKong  c void in the day's decade  HuaMu    c = tomb of element(o)
#   HuaJue   c = cutting-off of element(o)   HuaChong (c - o) mod 12 = 6
# Tombs: wood wei, fire xu, metal chou, water and earth chen. Cutting-off:
# wood shen, fire hai, metal yin, water and earth si. Void pair of day k:
# first = (k mod 12 - k mod 10 + 10) mod 12 and the next branch.
TRI = {"Qian": (1, 1, 1), "Dui": (1, 1, 0), "Li": (1, 0, 1), "Zhen": (1, 0, 0),
       "Xun": (0, 1, 1), "Kan": (0, 1, 0), "Gen": (0, 0, 1), "Kun": (0, 0, 0)}
START = {"Qian": 0, "Zhen": 0, "Kan": 2, "Gen": 4, "Kun": 7, "Xun": 1,
         "Li": 3, "Dui": 5}
YANG = {"Qian", "Zhen", "Kan", "Gen"}
BEL = (4, 2, 0, 0, 2, 1, 1, 2, 3, 3, 2, 4)
JIN = ((11, 0), (2, 3), (5, 6), (8, 9), (1, 4), (4, 7), (7, 10), (10, 1))
TOMB, JUE = (7, 10, 4, 1, 4), (8, 11, 5, 2, 5)
MOVES = ("JinShen", "TuiShen", "HuiSheng", "HuiKe", "HuaKong", "HuaMu",
         "HuaJue", "HuaChong")
NAME = {v: k for k, v in TRI.items()}

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

def moves(o, c, k):
    eo, ec = BEL[o], BEL[c]
    first = (k % 12 - k % 10 + 10) % 12
    return [(o, c) in JIN, (c, o) in JIN, (eo - ec) % 5 == 1,
            (eo - ec) % 5 == 2, c in (first, (first + 1) % 12),
            c == TOMB[eo], c == JUE[eo], (c - o) % 12 == 6]

if __name__ == "__main__":
    count, combo, n = [0] * 8, {}, 0
    for lo in TRI.values():
        for up in TRI.values():
            h = lo + up
            ob = najia(h)
            for i in range(6):
                cb = najia(tuple(b ^ (j == i) for j, b in enumerate(h)))
                for k in range(60):
                    hit = moves(ob[i], cb[i], k)
                    n += 1
                    for m in range(8):
                        count[m] += hit[m]
                    key = "+".join(MOVES[m] for m in range(8) if hit[m])
                    combo[key or "(none)"] = combo.get(key or "(none)", 0) + 1
    print("   cases: {}".format(n))
    for m in range(8):
        print("   {:9s} {:6d}  {:.4f}".format(MOVES[m], count[m], count[m] / n))
    print("   combinations of moves on one line:")
    for key, v in sorted(combo.items(), key=lambda t: -t[1]):
        print("     {:5d}  {:.4f}  {}".format(v, v / n, key))
    multi = sum(v for key, v in combo.items() if "+" in key)
    print("   lines with two or more moves: {} ({:.4f})".format(multi, multi / n))

Single source and citation

Fan, Y. (2026). The Rotating Qimen Chaibu and Liuyao Najia Codex of Business Verdicts (Version 1.0.0), Chapter 7: Six-Line Najia: Forty-Eight Cells of Relation and Move. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-121 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026121,
  author    = {Fan, Yafu},
  title     = {The Rotating Qimen Chaibu and Liuyao Najia Codex of Business Verdicts},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book