关于「转动的网格上何时何方行事」,《双人耦合与网格博弈》给出的定量结论是什么?

结论:第六章在转动的九宫上求解择时择向:方向自由时择时不增加价值(均值 0.900),方向固定时等待把均值从 −0.1500 提高到 +0.6625;有对手时博弈值不随时辰改变,均衡中中平之门(0.200)比吉门(0.133)用得更多。

数据口径:本书只研究这些数学结构本身,不主张、也不检验任何术数意义上的预测;全部数据为程序生成的合成数据,物理与博弈概念用于人际关系之处一律标为类比。 第七章与咸、恒两卦的《彖传》、《烟波钓叟赋》与杨辉纵横图并读;咸卦颠倒即为恒卦,被读作矩阵的转置,并标为诠释。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.6625, 0.900

   (a) direction and time free:      mean value +0.9000, lowest +0.900
   (c) time fixed, direction free:   mean value +0.9000, lowest +0.900
   (b) direction fixed, time free:   mean value +0.6625, lowest +0.300
       same, but going at once:      mean value -0.1500, lowest -1.200
Reading: the three good doors stand side by side, and the four
palaces next to the centre alternate around the ring, so a good
door is always one step from the centre: when the direction is
free, timing adds nothing. Timing matters only when the direction
is fixed; then waiting for a good door lifts the mean from below
zero to a clearly positive value. All of it rests on the values
put in.
查看完整验算程序
# Chapter 6. Where and when to act on a turning grid.
# The eight doors stand on the outer palaces in the ring order of p11:
#   Xiu Sheng Shang Du Jing Si Jing' Kai  (rest, life, harm, block, view,
#   death, fright, open), and turn one palace per time slot.
# By the conventional reading Kai, Xiu, Sheng are good (+1), Du and Jing
# ("view") are neutral (0), Shang, Si and Jing' ("fright") bad (-1); the
# centre counts 0. These values are an assumption fed into the model.
# A person starts in the centre at slot t0. Each slot they may stay or
# step to an orthogonal neighbour (cost 0.1 per slot), or act where they
# stand and collect that palace's current value; they must act within
# H = 8 slots. Backward induction over (cell, slot) gives the best plan,
# (a) when both direction and time are free, (b) when the direction is
# fixed (one given outer palace) and only the time is free, and (c) when
# the time is fixed (the first step) and only the direction is free.
import math

L = (4, 9, 2, 3, 5, 7, 8, 1, 6)
RING = [L.index(n) for n in (1, 8, 3, 4, 9, 2, 7, 6)]
DOOR_VALUE = [1, 1, -1, 0, 0, -1, -1, 1]   # Xiu .. Kai
H, COST, CENTRE = 8, 0.1, 4

def nbrs(c):
    r, k = divmod(c, 3)
    out = [c]
    for dr, dk in ((1, 0), (-1, 0), (0, 1), (0, -1)):
        if 0 <= r + dr < 3 and 0 <= k + dk < 3:
            out.append((r + dr) * 3 + k + dk)
    return out

def value_at(cell, t):
    if cell == CENTRE:
        return 0.0
    return float(DOOR_VALUE[(RING.index(cell) - t) % 8])

def best(t0, allowed):
    v = {}
    for step in range(H, -1, -1):
        for c in range(9):
            act = value_at(c, t0 + step) if c in allowed else -9.0
            if step < H:
                act = max(act, max(v[(n, step + 1)] - COST
                                   for n in nbrs(c)))
            v[(c, step)] = act
    return v[(CENTRE, 0)]

if __name__ == "__main__":
    outer = [c for c in range(9) if c != CENTRE]
    free = [best(t, set(range(9))) for t in range(8)]
    fixed_dir = [best(t, {c}) for t in range(8) for c in outer]
    go_now = []
    for t in range(8):
        for c in outer:
            steps = 1 if c in nbrs(CENTRE) else 2
            go_now.append(value_at(c, t + steps) - COST * steps)
    fixed_time = [max(value_at(n, t + 1) for n in nbrs(CENTRE)
                      if n != CENTRE) - COST for t in range(8)]
    rows = (("(a) direction and time free:     ", free),
            ("(c) time fixed, direction free:  ", fixed_time),
            ("(b) direction fixed, time free:  ", fixed_dir),
            ("    same, but going at once:     ", go_now))
    for label, vals in rows:
        print("   {} mean value {:+.4f}, lowest {:+.3f}".format(
            label, math.fsum(vals) / len(vals), min(vals)))
    print("\nReading: the three good doors stand side by side, and the four")
    print("palaces next to the centre alternate around the ring, so a good")
    print("door is always one step from the centre: when the direction is")
    print("free, timing adds nothing. Timing matters only when the direction")
    print("is fixed; then waiting for a good door lifts the mean from below")
    print("zero to a clearly positive value. All of it rests on the values")
    print("put in.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《双人相位耦合、双线性相容张量与时空网格博弈》第 6 章「转动的网格上何时何方行事」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090172

DOI: 10.5281/zenodo.24090172 · 阅读本章所在专著 · 5DL-B-062 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026062,
  author    = {Fan, Yafu},
  title     = {Dyadic Phase Coupling, Bilinear Compatibility Tensors and Spatiotemporal Grid Games},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090172},
  url       = {https://doi.org/10.5281/zenodo.24090172}
}

本书其他章节结论