What does Dyadic Coupling and Grid Games conclude, in numbers, about “When and Where to Act on a Turning Grid”?

Answer: Chapter 6 solves the choice of time and direction on the turning nine palaces: with the direction free, timing adds no value (a mean of 0.900); with it fixed, waiting raises the mean from −0.1500 to +0.6625; against a rival the value of the game does not change with the hour, and in equilibrium neutral doors (0.200) are used more than good ones (0.133).

Scope of the numbers: All data are synthetic, generated by its programs, and wherever physics or game theory is applied to people it is marked as an analogy. Chapter 7 reads the Tuan commentary on Xian and Heng, the Rhapsody of the Old Fisherman and Yang Hui's magic squares; that Xian upside down is Heng is read, as marked interpretation, as a transposed matrix.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 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.
Show the full program
# 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.")

Single source and citation

Fan, Y. (2026). Dyadic Phase Coupling, Bilinear Compatibility Tensors and Spatiotemporal Grid Games (Version 1.0.0), Chapter 6: When and Where to Act on a Turning Grid. 5D Library. https://doi.org/10.5281/zenodo.24090172

DOI: 10.5281/zenodo.24090172 · Read the monograph · 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}
}

Other chapter answers in this book