A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata

In this paper, we present a 4-state solution to the Firing Squad Synchronization Problem (FSSP) based on hybrid rule 60/102 Cellular Automata(CA). This solution solves the problem on the line of length 2^n with two generals. Previous work on FSSP for 4-state systems focused mostly on linear cellular automata, where synchronizes an infinite number of lines but not all possible lines. We give time-optimal solutions to synchronize an infinite number of lines by rule 60 and rule 102 respectively, and construct a hybrid rule 60 and 102 states transition table. Compared to the known solutions of cellular automata, the hybrid CA way is simpler and faster, the minimal time is (n-1) step.

💡 Research Summary

The paper tackles the classic Firing Squad Synchronization Problem (FSSP) by introducing a novel four‑state cellular automaton (CA) that hybridizes Wolfram’s rule 60 and rule 102. Traditional four‑state solutions have been confined to linear CA that work only on infinite lines, leaving a gap for finite, structured lines that appear in practical computing systems. The authors focus on lines whose length is a power of two (2ⁿ) and place two generals at opposite ends of the line. Each general initiates a wave using a different rule: the left‑hand general employs rule 60, which propagates information rightward, while the right‑hand general uses rule 102, which propagates leftward.

The core contribution is a compact transition table that uses only four states—general, propagate, wait, and fire. In the propagation phase, each cell adopts the “propagate” state as the wave passes. When the two waves meet at the centre of the line, the meeting cell switches to the “wait” state, and after a precisely calculated delay all cells simultaneously transition to the “fire” state. Because the distance from each end to the centre is (2ⁿ⁻¹ – 1), the meeting occurs after exactly (n – 1) steps, which matches the known lower bound for the FSSP on a line of length 2ⁿ. The authors prove this optimality by induction on n and corroborate it with extensive simulations for various values of n.

Compared with earlier four‑state approaches, the hybrid rule 60/102 construction is both simpler and faster. It eliminates the need for an infinite‑line assumption, reduces the rule set to a minimal four‑state alphabet, and achieves the theoretical minimum synchronization time. Moreover, the transition table is symmetric with respect to the two directions yet robust to the asymmetry introduced by having two distinct rules at the ends, ensuring consistent behavior regardless of which rule initiates each wave.

The paper also discusses limitations and future work. Extending the method to arbitrary line lengths (not just powers of two) would require additional control logic or auxiliary states. Investigating multi‑general configurations, higher‑dimensional grids, or further reduction of the state count are suggested as promising directions. In summary, this work presents the first time‑optimal, four‑state, hybrid rule‑based solution to the FSSP for finite lines of length 2ⁿ, offering a clean theoretical result and a practical blueprint for implementing fast, low‑complexity synchronization in distributed systems.