Simple 8-state minimal time solution to the firing squad synchronization problem

The objective of the firing squad synchronization problem is to define sets of states and transition rules of a finite-state machine so that a one-dimensional array of such machines work synchronously. A minimal time solution to this problem was first found by Goto in 1961. Thereafter, other minimal time solutions were reported. I studied this problem and found an 8-state 119-rule solution by using a simple algorithm. The number of rules is much less than in Baltzer's 8-state solution and the same as in Mazoyer's 6-state solution.