What does Rotating Qimen and Liuyao Business Verdicts conclude, in numbers, about “The Nineteen Named Patterns: Detection Rules, Real Frequencies and Verdicts”?

Answer: This chapter has written out, pattern by pattern, the detection rules, classical images and verdicts of the nineteen named patterns. With all 1,080 bureau-hours weighted equally: Heaven Escape is the rarest (0.0083), Door Pressed the most common (0.6667), Six Yi Punishment occurs in more than half (0.5296), Qi Meets the Envoy in more than four in ten (0.4315), Fu Yin in 0.3204, star Fu Yin and door Fu Yin each in 0.2222. Over the 87,660 hour charts of 2024 to 2043 in Beijing time, the shares differ from the equal-weight ones only in the fourth decimal. Nearly every chart mixes favourable and adverse patterns (0.7056), and a chart free of adverse patterns occurs in only 0.0259; so a named pattern is read by the palace it falls in, not by whether it appears. These verdicts are interpretations; the chapter gives one test that can be pre-registered.

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.0083, 0.2222, 0.3204, 0.4315, 0.5296, 0.6667

bureau-hours: 1,080
QingLongFanShou1090.1009
FeiNiaoDieXue1070.0991
TianDun90.0083
DiDun170.0157
RenDun120.0111
ShenDun200.0185
GuiDun110.0102
FengDun360.0333
YunDun430.0398
LongDun650.0602
HuDun200.0185
SanQiDeShi4660.4315
YuNvShouMen1100.1019
SanQiShengDian3710.3435
LiuYiJiXing5720.5296
SanQiRuMu3700.3426
MenPo7200.6667
FuYin3460.3204
FanYin2200.2037
star fu yin0.2222
door fu yin0.2222
star fan yin0.1111
door fan yin0.1111
star and door fu yin together 0.1241
mean patterns per chart 3.3556
Show the full program
# Chapter 6. p30: Share of the 1,080 bureau-hours that show each of the 19 named patterns.
# Chaibu rotating plates as in chapter 1: the earth plate is laid from the
# bureau number (forward in yang dun, backward in yin dun); the stars turn
# round the outer ring so that the duty star reaches the hour stem; the
# centre's stem rides with Rui; the duty door walks one Luoshu palace per
# hour stem from the decade leader (centre counted as Kun 2); the spirits
# start at the duty star's new palace. Each pattern is then tested with the
# exact rule printed in chapter 6. All 9 x 2 x 60 = 1,080 bureau-hours are
# weighted equally.
RING = (1, 8, 3, 4, 9, 2, 7, 6)            # outer ring, clockwise from Kan
YIQI = ("wu", "ji", "geng", "xin", "ren", "gui", "ding", "bing", "yi")
STEMS = ("jia", "yi", "bing", "ding", "wu", "ji", "geng", "xin", "ren", "gui")
STAR = {1: "Peng", 2: "Rui", 3: "Chong", 4: "Fu", 6: "Xin", 7: "Zhu", 8: "Ren", 9: "Ying"}
DOOR = {1: "Xiu", 2: "Si", 3: "Shang", 4: "Du", 6: "Kai", 7: "Jing7", 8: "Sheng", 9: "Jing9"}
GODS = ("ZhiFu", "TengShe", "TaiYin", "LiuHe", "BaiHu", "XuanWu", "JiuDi", "JiuTian")

def step(p, yang, n=1):
    for _ in range(n):
        p = p % 9 + 1 if yang else (p - 2) % 9 + 1
    return p

def chart(ju, yang, k):
    """Rotating chart of bureau ju, dun yang/yin, hour k (0 = jia-zi):
    {palace: [heaven stems, earth stem, star, door, spirit]}, duty door."""
    earth = {step(ju, yang, i): s for i, s in enumerate(YIQI)}
    where = {s: p for p, s in earth.items()}
    xp = where[YIQI[k // 10]]
    src = 2 if xp == 5 else xp
    tp = where[YIQI[k // 10] if k % 10 == 0 else STEMS[k % 10]]
    tp = 2 if tp == 5 else tp
    dp = step(xp, yang, k % 10)
    dp = 2 if dp == 5 else dp
    sh = RING.index(tp) - RING.index(src)
    dsh = RING.index(dp) - RING.index(src)
    c = {q: [[], earth[q], "", "", ""] for q in RING}
    for i, q in enumerate(RING):
        to = c[RING[(i + sh) % 8]]
        to[0] = [earth[q]] + ([earth[5]] if q == 2 else [])
        to[2] = STAR[q]
        c[RING[(i + dsh) % 8]][3] = DOOR[q]
    for g, name in enumerate(GODS):
        c[RING[(RING.index(tp) + (g if yang else -g)) % 8]][4] = name
    return c, DOOR[src]

PAT = ("QingLongFanShou", "FeiNiaoDieXue", "TianDun", "DiDun", "RenDun",
       "ShenDun", "GuiDun", "FengDun", "YunDun", "LongDun", "HuDun",
       "SanQiDeShi", "YuNvShouMen", "SanQiShengDian", "LiuYiJiXing",
       "SanQiRuMu", "MenPo", "FuYin", "FanYin")
PPHASE = {1: 4, 2: 2, 3: 0, 4: 0, 6: 3, 7: 3, 8: 2, 9: 1}  # 0 wood .. 4 water
DPHASE = {"Xiu": 4, "Sheng": 2, "Shang": 0, "Du": 0, "Jing9": 1, "Si": 2,
          "Jing7": 3, "Kai": 3}
ENVOY = {("yi", "ji"), ("yi", "xin"), ("bing", "wu"), ("bing", "geng"),
         ("ding", "ren"), ("ding", "gui")}
ASCEND = {"yi": 3, "bing": 9, "ding": 7}
PUNISH = {"wu": 3, "ji": 2, "geng": 8, "xin": 9, "ren": 4, "gui": 4}
TOMB = {"yi": 2, "bing": 6, "ding": 8}
OPP = {1: 9, 9: 1, 2: 8, 8: 2, 3: 7, 7: 3, 4: 6, 6: 4}
GOOD = ("Kai", "Xiu", "Sheng")

def detect(c, duty):
    """Set of pattern names present (rules of chapter 6, outer palaces)."""
    f = set()
    for q, (h, e, star, door, god) in c.items():
        pr = {(a, e) for a in h}
        g = door in GOOD
        tests = (("wu", "bing") in pr, ("bing", "wu") in pr,
                 "bing" in h and door == "Sheng" and e == "ding",
                 "yi" in h and door == "Kai" and e == "ji",
                 "ding" in h and door == "Xiu" and god == "TaiYin",
                 "bing" in h and door == "Sheng" and god == "JiuTian",
                 "ding" in h and door == "Du" and god == "JiuDi",
                 "yi" in h and g and q == 4,
                 "yi" in h and g and e == "xin",
                 "yi" in h and ((door == "Xiu" and q == 1) or (g and e == "gui")),
                 ("yi" in h and door in ("Xiu", "Sheng") and e == "xin" and q == 8)
                 or ("geng" in h and door == "Kai" and q == 7),
                 bool(pr & ENVOY), door == duty and e == "ding",
                 any(ASCEND.get(a) == q for a in h),
                 any(PUNISH.get(a) == q for a in h),
                 any(TOMB.get(a) == q for a in h),
                 PPHASE[q] == (DPHASE[door] + 2) % 5)
        f |= {PAT[i] for i, t in enumerate(tests) if t}
    plates = fu_fan(c)
    if plates[0] or plates[1]:
        f.add("FuYin")
    if plates[2] or plates[3]:
        f.add("FanYin")
    return f

def fu_fan(c):
    """(star fu yin, door fu yin, star fan yin, door fan yin)."""
    return (all(c[q][2] == STAR[q] for q in c), all(c[q][3] == DOOR[q] for q in c),
            all(c[q][2] == STAR[OPP[q]] for q in c),
            all(c[q][3] == DOOR[OPP[q]] for q in c))

if __name__ == "__main__":
    rows = [chart(ju, yang, k) for ju in range(1, 10) for yang in (1, 0)
            for k in range(60)]
    found = [detect(c, d) for c, d in rows]
    n = len(found)
    print("   bureau-hours: {:,d}".format(n))
    for p in PAT:
        m = sum(p in f for f in found)
        print("   {:16s} {:4d}  {:.4f}".format(p, m, m / n))
    ff = [fu_fan(c) for c, _ in rows]
    for i, lab in enumerate(("star fu yin", "door fu yin", "star fan yin",
                             "door fan yin")):
        print("   {:13s} {:.4f}".format(lab, sum(x[i] for x in ff) / n))
    print("   star and door fu yin together {:.4f}".format(
        sum(x[0] and x[1] for x in ff) / n))
    print("   mean patterns per chart {:.4f}".format(
        sum(len(f) for f in found) / n))

Single source and citation

Fan, Y. (2026). The Rotating Qimen Chaibu and Liuyao Najia Codex of Business Verdicts (Version 1.0.0), Chapter 6: The Nineteen Named Patterns: Detection Rules, Real Frequencies and Verdicts. 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