2019-11-15 17:37:51
Research — Cellular Automata — The Firing Squad (Mazoyer)
The goal of these productions is to inspire some science to the largest
possible audience. These complements have been made with the help of Université Paris Diderot
and CNRS, and especially the IRIF.
These supports are free of charge and can be freely reused. This does not mean that you are free to credit yourself for it.
These supports are free of charge and can be freely reused. This does not mean that you are free to credit yourself for it.
Some videos showing FSSP’s solutions built by professor Jacques Mazoyer (IXXI / ENS Lyon, France)
Download here and here the videos showing the dynamic of Mazoyer's 6-states solution to the FSSP.
This solution is known to be a real tour de force, it uses only 6 states (today's minimal number of states) to synchronize a line of length n in 2n-steps (minimal possible time). It is known that there is no 4-states such solution, but it is open if a 5-states exists. An interesting thing about this solution is that it uses no symmetry during the recursive calls.
This solution is known to be a real tour de force, it uses only 6 states (today's minimal number of states) to synchronize a line of length n in 2n-steps (minimal possible time). It is known that there is no 4-states such solution, but it is open if a 5-states exists. An interesting thing about this solution is that it uses no symmetry during the recursive calls.
Download here the movie illustrating the conservative extension of Mazoyer's solution made by Yunès.
This extension makes the solution insensitive to the initial location of the general; the price to pay is to loose the minimal-time property of the solution.
This extension makes the solution insensitive to the initial location of the general; the price to pay is to loose the minimal-time property of the solution.