Time-Optimal Solution of the Firing-Squad-Synchronization-Problem for n-Dimensional Rectangles with the General at an Arbitrary Position

A time-optimal solution to the firing-squad-synchronization-problem of n-dimensional rectangles with the general at an arbitrary position is presented. The solution uses one-dimensional time-optimal fssp algorithms which have a symmetrical transition function and use as few states as the best known non-symmetrical transition functions. The n-dimensional case is demonstrated for n = 2, and the straightforward generalization to larger n is outlined.