Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces
Here we present a solution to the generalized firing squad synchronization problem that works on some class of shapes in the hexagonal tiling of the plane. The solution is obtained from a previous solution which works on grids with either a von Neumann or a Moore neighborhood. Analyzing the construction of this previous solution, we were able to exhibit a parameter that leads us to abstract the solution. First, and for an arbitrary considered neighborhood, we focus our attention on a class of shapes built from this neighborhood, and determine the corresponding parameter value for them. Second, we apply our previous solution with the determined parameter value for the hexagonal neighborhood and show that, indeed, all the considered shapes on the hexagonal tiling synchronizes.
KeywordsCellular Automaton Synchronization Time Border Cell Space Shape Distance Field
- 5.Maignan, L., Yunès, J.B.: Moore and von Neumann neighborhood n-dimensional generalized firing squad solutions using fields. In: AFCA 2013 Workshop, CANDAR 2013 Conference, Matsuyama, Japan, 4–6 December 2013Google Scholar
- 16.Umeo, H.: Recent developments in firing squad synchronization algorithms for two-dimensional cellular automata and their state-efficient implementations. In: AFL, pp. 368–387 (2011)Google Scholar
- 17.Yamakawi, T., Amesara, T., Umeo, H.: A note on three-dimensional firing squad synchronization algorithm. In: ITC-CSCC, pp. 773–776 (2008)Google Scholar