Mazoyer's Solution to the FSSP

For discussion of other cellular automata.
Post Reply
User avatar
Freywa
Posts: 878
Joined: June 23rd, 2011, 3:20 am
Location: Singapore
Contact:

Mazoyer's Solution to the FSSP

Post by Freywa »

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):
FSSPMazoyer.rule
The rule transcribed from Mazoyer (1987)
(875 Bytes) Downloaded 188 times
To prove it works:
fssp.mc
Is self-explanatory
(602 Bytes) Downloaded 185 times
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!
User avatar
Scorbie
Posts: 1728
Joined: December 7th, 2013, 1:05 am

Re: Mazoyer's Solution to the FSSP

Post by Scorbie »

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?
Post Reply