Mazoyer's Solution to the FSSP
Mazoyer's Solution to the FSSP
Over the last few days, acting on some advice by Martin Grant, I've concentrated myself on the firing squad synchronisation problem (FSSP): start with a line of cells, excite one and devise some rules so that no matter how long your line is all cells will eventually reach a firing state. It is not known how many states are the minimum possible, but 4 is impossible and 6 is realised in the following minimal-time (2n-2 generations) ruleset which I transcribed from Mazoyer (1987):To prove it works:
Now I'm trying to put this into Conway's Life!
Princess of Science, Parcly Taxel
Code: Select all
x = 31, y = 5, rule = B2-a/S12
3bo23bo$2obo4bo13bo4bob2o$3bo4bo13bo4bo$2bo4bobo11bobo4bo$2bo25bo!Re: Mazoyer's Solution to the FSSP
Looks nice, after understanding the content!
Would be interesting to imagine what form it will be in conway's life. What do you plan the firing state to be?
Would be interesting to imagine what form it will be in conway's life. What do you plan the firing state to be?