关于「主客算筹的博弈边界:基率泄漏与「多条读法择优」的上限」,《太乙神数的同余结构与博弈边界》给出的定量结论是什么?
结论:第五章推导主客读法的博弈边界:在主方占七成的记载上,毫无信息的读法也能比掷硬币高出 0.083。
数据口径:书中参数为示意;全部计算由书中程序生成;书中灾异年表为固定种子生成的合成数据。 第六章在合成年表上做随机置换检验,最「显著」的格局族系 p 值为 0.501,计入积年与容差的选择后,至少一条路径名义显著的机会是 0.867。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.083
| q(longer count names host) = 0.458 | ||||
| q(host count >= 10) | = 0.708 | |||
| b | longer | host>=10 | always host | bound |
| 0.30 | 0.517 | 0.417 | 0.300 | 0.700 |
| 0.40 | 0.508 | 0.458 | 0.400 | 0.600 |
| 0.50 | 0.500 | 0.500 | 0.500 | 0.500 |
| 0.60 | 0.492 | 0.542 | 0.600 | 0.600 |
| 0.70 | 0.483 | 0.583 | 0.700 | 0.700 |
| at b = 0.70 the >=10 rule beats a coin by 0.083 with zero information |
查看完整验算程序
# Chapter 5. p51: base-rate leakage. If a record's outcomes do not
# depend on the counts at all, a rule that names the host side in a
# share q of years and a record in which the host side prevails in a
# share b of contests agree in q*b + (1-q)*(1-b) of cases. q comes from
# the exact 72-year enumeration; b is illustrative. Bound: no rule
# without information beats max(b, 1-b) in expectation.
from fractions import Fraction
# Ring of sixteen gods, clockwise from zi; ring slots that are palaces
# carry the Taiyi palace number (Jinjing vol. 2 example: from Dayi (hai)
# 1, Dizhu (zi) 8, Hede (gen) 3, Gaocong (mao) 4, total 16 before xun 9).
RING = ("zi", "chou", "gen", "yin", "mao", "chen", "xun", "si",
"wu", "wei", "kun", "shen", "you", "xu", "qian", "hai")
PAL = {0: 8, 2: 3, 4: 4, 6: 9, 8: 2, 10: 7, 12: 6, 14: 1}
POS = {p: k for k, p in PAL.items()}
TY_ORDER = (1, 2, 3, 4, 6, 7, 8, 9) # skips the centre 5
# Wenchang starts at Wude (shen) and walks clockwise; qian and kun each
# hold it two years, so one circuit of 16 gods takes 18 years.
WC_SEQ = (11, 12, 13, 14, 14, 15, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10)
BR_POS = (0, 1, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15) # 12 branches on ring
def taiyi(j):
r = j % 360 % 72 % 24 or 24
return TY_ORDER[(r - 1) // 3]
def wenchang(j):
r = j % 360 % 72 % 18 or 18
return WC_SEQ[r - 1]
def jishen(j):
r = j % 60 or 60 # from yin, counter-clockwise
return BR_POS[(2 - (r - 1)) % 12]
def shiji(j):
# Jishen laid on Hede (gen, slot 2); read where Wenchang falls
return (wenchang(j) + 2 - jishen(j)) % 16
def count(start, ty):
stop = POS[ty]
k, tot = start, PAL.get(start, 1)
if k == stop:
return tot
k = (k + 1) % 16
while k != stop:
tot += PAL.get(k, 0)
k = (k + 1) % 16
return tot
def host(j):
return count(wenchang(j), taiyi(j))
def guest(j):
return count(shiji(j), taiyi(j))
def acc(q, b):
return q * b + (1 - q) * (1 - b)
if __name__ == "__main__":
js = range(72)
q1 = Fraction(len([j for j in js if host(j) > guest(j)]), 72)
q2 = Fraction(len([j for j in js if host(j) >= 10]), 72)
print(" q(longer count names host) = {:.3f}".format(float(q1)))
print(" q(host count >= 10) = {:.3f}".format(float(q2)))
print(" b longer host>=10 always host bound")
for b100 in (30, 40, 50, 60, 70):
b = Fraction(b100, 100)
print(" {:.2f} {:>6.3f} {:>8.3f} {:>11.3f} {:>5.3f}".format(
float(b), float(acc(q1, b)), float(acc(q2, b)), float(b),
float(max(b, 1 - b))))
b = Fraction(70, 100)
gain = acc(q2, b) - Fraction(1, 2)
print(" at b = 0.70 the >=10 rule beats a coin by {:.3f}"
" with zero information".format(float(gain)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《太乙神数十六宫游走、积年同余周期与主客算筹博弈边界》第 5 章「主客算筹的博弈边界:基率泄漏与「多条读法择优」的上限」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-154 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026154,
author = {Fan, Yafu},
title = {Taiyi Shenshu: Sixteen-Palace Walks, Accumulated-Year Congruence Cycles and the Game Bounds of Host and Guest Counting Rods},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}