A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem
A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem
复制标题
射击队同步问题的六状态最短时间解
DOI：
10.1016/0304-3975(87)90124-1
复制
发表时间：
1987
期刊：
影响因子：
--
通讯作者：
J. Mazoyer
中科院分区：
文献类型：
--
作者：
J. Mazoyer
从巴尔泽的工作（1967），我们知道，行刑队同步问题有一个最小时间的解决方案与八个国家。我们证明了这样一个解只存在六个状态。我们的方法与以前的方法有些不同：初始线被迭代地分成两个不相等的部分，使得每个新的右部分可以被视为较短的初始线的相似图像。
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.