Skip to content
Adjacency Theory markAdjacency Theory

Phase 33 · constrained schedules

Can one fixed rule travel?

AT-0255 → AT-0262. Benchmark seed 255. Six coupling segments, a mandatory floor, full coupling restored before the run ends, and the score is the worst identity disturbance at any moment. The question is no longer whether a tuned schedule helps one system — it is whether a single frozen rule helps systems it has never seen.

Core objective

Loading.

Plain language

Loading.

Controls

Running the constrained-schedule package — per-case search, frozen transfer to unseen systems, floor estimation, invariant controls and the auxiliary-control audit. This takes several seconds.