Mazoyer's Solution to the FSSP
Posted: January 2nd, 2015, 11:32 pm
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!