A six-state minimal time solution to the firing squad synchronization problem

Jacques Mazoyer
1987 Theoretical Computer Science  
From Balzer's work (1967) , we know that the firing squad synchronization problem has a minimal-time solution with eight states. We show that such a solution exists with only six states. Our method is somewhat different from all previous ones: the initial line is iteratively divided in two inequal parts so that each new right part can be treated as the homothetical image of a shorter initial line.
doi:10.1016/0304-3975(87)90124-1 fatcat:5lrnotub2jfvbk6isxw3zynooy