[Laser] Firing squad synchronization problem
ฝัง
- เผยแพร่เมื่อ 25 มี.ค. 2021
- The video shows a theoretical problem in computer science and a solution for it. It is presented as a riddle, but note it's not easy to solve.
The shown solution is based on the first solution proposed for this problem. It requires ~3n steps, and 17 states.
See list of states and some additional information here: www.udiprod.com/firing-squad-...
“Yeah, we had some budget cuts this year, so we can’t go with the executioner robots.”
“What are we using, then?”
“The dancers.”
Hey, at least they’re programmable
I think it‘s the different way a round
how are there TWO replies and 2k likes
The Clone Wars in a nutshell!
Roger Roger Now launching, Just Dance!
imagine being sentenced to death by a robot autocracy, and the last thing you see before you die is your executioners just grooving
The war of the sorting robots
"Sargent, give the order."
"Yes sir."
*Bonk*
"What are they doing, Sargent"
"Grooving, sir"
The goofiest dystopia.
If it's execution by groovin robots I'd be more than willing to accept my fate
Instead of being blindfolded, you get a nice visual before you get fucking murdered.
i enjoy how a lot of the sync-related problems go "yea ok just split the big group into the little group"
Smaller groups are easier to work with, so if we can make a small group out of a big one, we can make the problem easier
At least I think so
that was my algorithms class in a nutshell
recursion recursion recursion
Divide and conquer
Yes, that's literally how you solve pretty much any problem ever.
Especially problems where all you have is one bit of information, because you can only work with that one.
The weird thing about these types of videos is that visually you can see it work, follow it, and it appears simple. But there are likely pages of math computations that prove this out that never get shown. I'd never follow it, but I'd like to see the math behind it.
The weirder part is THIS is the more difficult to understand version 🤣
There’s a quote that says “if you can’t explain something simply, then you don’t understand it well enough”
@@jjwkoesterI prefer phrasing that as "You have truly understood a complex concept when you can describe it in a simple manner." It feels more positive, in my opinion :)
@@Catman_CMand in general fairness, more correct.
My thoughts went to waveform interference; the robots act as a medium where you’d normally use water for a demonstration.
Eventually the waves bounce enough times to synchronize a “destructive” wave, clearing the signal.
POV: you and your N-1 human friends watch a squad of robot overlords doing a funny dance in order to synchronize their movements perfectly so they can execute all of you at the exact same time
I like how this post accounts for people with no friends lol
What a lovely story
@@art1637 According to the description N>=3. You will need at least 2 friends.
everybody gangsta until the firing squad starts dancing
imagine youre been sentenced to firing squad and you have to stand there watching for 30 min while they dance and figure out when to fire
This is a pretty effective intimidation tactic
It's like being executed by the Ginyu Force.
@@pvic6959 They do a full musical number about their lives as members of a firing squad, and your death comes on the last beat of the song.
I don't think anybody gangsta if your on the receiving end of the firing squad
We went from sorting robots to laser firing squads. Amazing.
Is there a cut version of just the "dancing" robots out there? Did you hand-animate each squad or did you create a utility to do these in practice animations for you?
Thanks! It's procedural animation. Yes, a cut version is a nice idea, I'll consider doing that with a few more runs.
Ah, thank you for the reply. I'll glad if you do release one eventually.
I may or may not imagine a tool that can synchronise the firing squad(s) to any song given a BPM and be laughing much too hard at all the inappropriate results. Dang it, now I want to see "Robot execution synched to _I Will Survive_". I hope you enjoy the thought as much as I do.
@@udiprod i need a version without a beats, just a nice continuus flow of dance and moves.
Huh, that's a neat solution. Mine was to use an iterator at the end of the line, but I'm not sure if that breaks the "finite poses" rule:
- Build an arbitrary list of poses greater than the number of robots.
- Robot 1 assumes the pose that says "I am number 1!"
- Each idle robot looks to its right and assumes the pose one higher than that (unless right is also idle).
- When you get to the end, you've counted all the robots!
- The last robot (which sees a blank space next to it) begins ticking down through all the poses ("blank left & not idle = my pose - 1").
- Each other robot, when it sees a robot with the same pose on its left, ticks down one pose.
- When the robots declare "We are number 1!" ("I am number 1 & left is number 1") they're ready to tick over into "Firin' ma lazor!".
It specifically mentions a squad of any FINITE size, so I would argue your solution is more elegant and exactly where my head went with this one!
needs to work for ANY finite size of squad, but you have to define A finite amount of poses in your solution.
If you can find a finite quantity that is greater than any other finite quantity, hit me up.
That’s a neat solution. My solution was:
if you are an officer, fire
if you are not an officer, fire
All of them have fired at the same time.
It does break the finite poses rule, as there must be one finite set of poses and rules that works for ALL finite squads, -- so no matter how many poses you have, there is a squad with more robots than you have poses.
“Here’s a robot firing squad” is possibly the most ominous first line in any TH-cam video
LMAO
Tom Scott
*proceeds to activate robot firing squad that is facing towards you*
But very effective
“vsauce, Michael here”
"pause if you want to think about it"
Meanwhile on the screen: "problem proposed in 1957, solution found in 1967"
Think i'll pass.
Sometimes the solution to a problem is not solved with careful study and experimention, but with a singular flash of insight. For instance, Archimedes' "eurika" moment, or Newton an the apple.
@@extraintelligence I think OC accepts he isn't Archimedes or Isaac Newton
@@kurumi394 not with that attitude.
@@extraintelligence Not with that name, either
Thanks for that comment! I felt extremely stupid thinking for many hours and being stuck with some sort of binary counting for a long time. Now I feel extremely proud to have found a solution at all.
The solution I found in the end is pretty similar to the one presented in the video.
Football star: gets brutally injured.
The cheerleaders; 7:20
One thing to point out here is that since the state transitions of each robot only depend on their immediate neighbors, you don't have to have any knowledge of how big the pool of robots is. But if you added a little bit of memory, you could probably arainge it so that once the synchronization event takes place, every robot knows what their position in the line is, up to some limit.
The entire point of this is that no such construct is needed.
That said it has "memory", as a whole unit.
I just wrote this out replying to a different comment, and it does work, and faster than the video's algorithm.
You can just use a 128-bit number that guarantees it can store the number of computers in the system (64 bits is almost certainly sufficient and 16-32 bits is overkill in most real cases, but there aren't even 2^128 atoms in the observable universe, so it's guaranteed). Each robot has 128 "legs" with two states (representing a single 128-bit number), then the "hands" tell it whether the signal is coming, going or idle.
So computer 1 gets the start signal, says "leaving", "1" to its neighbor. The neighbor sees "leaving", adds 1 to the count and propagates "leaving", "2" to the next neighbor. This proceeds to the last computer, which holds the final count of computers, "N". After the right-hand neighbor is set to "leaving", the current computer can return to idle or just sit in the current state.
The final computer sees that it's final and switches to "returning", "N". The penultimate computer sees "returning" and also switches, but subtracts 1 from the current count to be "returning", "N-1". This repeats back to the beginning.
The difference on the return trip is that after the state is "returning", each computer counts down by 1 every tick. So the "returning" signal will hit computer 2 when the count is "2", but every computer to its right will also have counted down to 2. As computer 1 sets its state to "returning", "1", computer 2 counts down once to "1" (along with all the other computers).
Now, all the computers count down once to zero and fire. Alternately, they could all fire at 1, and computer 1 knows to fire next tick if the computer to its right says "returning", "2" this tick.
For N=11, the video took 34 ticks, where mine will do it in 21 ticks (10 "leaving" ticks, then 11 "returning" ticks, since the last computer can transition from idle directly to "returning", "N" and skip the "leaving" tick).
Even better is if whatever method you're using to synchronize ticks just counts all the computers each time and you can just store the total computers plus a given computer's place in line. Then *any* computer can originate the signal and start the count based on the farthest distance from it (a middle computer would start at N/2, for example). If one computer sends a signal after another already did, but before it knows about the signal, all computers seeing both signals can just use the lowest count.
@@GeekOfAllnessyou're using memory to run in linear time, whereas the memory-less version runs in log time. Not so strange.
Since they have no memory all they know is that since they’re not a general yet the group must be bigger
Imagine being on death row for committing several war crimes, and you're sentenced to death via firing squad. As an extra punishment, they have you executed via 128 robot soldiers that do this, and at 15 BPM
Stop trying to escape! We have to reset the process every time you do that.
“Okay how about this, give me a flag and when i raise it you guys shoot. I’m not gonna stand here waiting for you guys to shoot”
I would love this. thank you.
The fucking suspense that would create
Alright, let’s take out some math and see how long it would take.
Seeing as the BPM is 15, one beat will take 4 seconds, so we will multiply the number of beats by 4 to get the time in seconds.
We now check if 128 is a perfect power of 2. It is, being the 7th power of 2. We don’t need any double general rules.
The first hand signal will take 3n/2 beats to propagate to the end and back to the middle. Our squad is 128 robots, so 3(128)/2 = 192 beats.
Our squad is now split into subsquads of 64 robots. 3(64)/2 = 96 beats. 192 + 96 = 288 beats so far.
Now we have subsquads of 32. But here’s where we employ a neat trick. Because our squad size has been divided by 2 each time, so has our number of steps to division. We can simply divide the previous number of steps by 2. 96 / 2 = 48 beats.
We can verify this fact by also evaluating the old steps formula. 3(32)/2 = 48 = 96 / 2.
288 + 48 = 336 beats so far.
Subsquads of 16. 48 / 2 = 24. 336 + 24 = 360 steps so far.
Subsquads of 8. 24 / 2 = 12. 360 + 12 = 372 beats so far.
Subsquads of 4. 12 / 2 = 6. 372 + 6 = 378 beats so far.
Subsquads of 2. 6 / 2 = 3. 378 + 3 = 381 beats so far.
Now we simply add 1, representing our final firing order, to get a grand total of 382 beats from start to firing.
Now let’s evaluate the time in seconds. We simply multiply our number of beats by 4 to get 1528 seconds.
Now how long is that in seconds _and_ minutes? One minute is 60 seconds, so we divide 1528 by 60, keeping the remainder as the number of seconds. We get our final answer of an insane *25 minutes 28 seconds.*
Its important to have all the robots fire at the same time so that any individual robot won't feel guilty from knowing they had pulled the killing shot.
Guitly, or perhaps satisfied
Nah they can't see past their neighbors nor remember the past, I think they're gonna sleep well tonight after their neighbor signals that it's nighttime. xD
nooo u can’t just break the first law of robotics
machine gun goes brrr
@@kaidatong1704 if nobody saw it its not a crime
@@happmacdonald that nighttime bit got mw
I am so incredibly grateful that you finished off the video by just giving an opportunity to watch the robots do their thing a few times. Cool stuff!
no clue what i just watched but i can tell whoever came up with it is a genius
This video felt like some kind of AI is trying to trick me into progamming a dissident-killing subroutine for it.
Lol
Lmfao
no bueño
Skynet: "Dammit, they're onto us!"
However, due to a design flaw, in the time the robots take to finish the sequence and set up for firing, the prisoner has already broken free from their restraints, disarmed the guards and escaped over the side of the wall.
@@Warze And that's why you don't drink while designing your robotic executioners.
You think you can escape them? They may be slow and limited to finite state machine commands, but they are immortal and relentless. Better to die by the merciful hand of a laser gun than huddling in a dark cave dreading your coming doom
Rearrange them into a circle so that the left leg signal can never meet the right hand signal.
@@stelcxantisto nah just make this the josephus problem and get it over with
Just get one robot
Amazing. It's incredible to see what can be accomplished with ratios and 3n.
This is probably the most random video I've ever watched and I loved every second of it.
Prisoner: *Dances along to the beat*
Warden: *Dances along to the beat*
Shooters: *Dancing along to the beat*
Prisoner: *Dances away slowly*
I'd like, but I'm afraid that I might cause an unsigned integer overflow to 0. If there is no integer overflow though, I will like because I was wrong. (back when it was at 255 likes)
@@legendgames128 Yes you're very clever, this is youtube.
@@squidgelad1983 but that was a joke, a programing joke
@@legendgames128 Gosh dang it, take your like, you fellow programming punster of a mad lad.
@@legendgames128 I assume 32-bit integers are used, not 8-bit, the real question is, what happens when we exceed 4.29 Billion likes
I've been sentenced to death but robocop over here can't stop doing fortnight dances to taunt me.
Brilliant!
Until he finishes dancing
Ironically, Robocop is now in fortnite
@@ITSMRFOXYIt's fortnight, Fortnite is the kids version
Imagine being in death row and the executioner starts arkwardly dancing while everyone is super serious. I would die laughing sooner than he would have shot me down lol
A classic divide and conquer approach. I love the solution, it's beautiful.
the more green-lit generals i see, the more nervous i get.
Probably because you are the prisoner from abusive AI usage (AI torture for music generation)
POV: You get killed by the robot firing squad after committing genocide on 2 music AIs
TIL cary watches udiprod
The living legend himself
I keep seeing you in every comment section lol
Engineers: “Just make them all shoot once a signal is given, these constraints do nothing but hamper their functions.”
Mathematicians be like:
Yeah if the whole process is started off by hitting the first robot why not just hit all of them at the same time 😂
Actually this is a real engineering problem. Its from computer science, and the practical considerations are (Surprisingly enough) in computers. When computers are involved, each machine can be far enough away that only adjacent machines on the network can talk, and synchronisation of certain tasks can be important. This is the engineering side of it.
It's a bit like the two generals problem - its seems silly to talk about, and like its just a problem for the sake of logic and maths, but its something that actually needs to be considered when dealing with computer networks.
@@samfriend3675 what situation would result in only adjacent clients be able to talk in a network?
@@KavsLockedOut daisy chain a bunch of computers together, have first one connected to the server and then have them try play epic dubstep hardest beat drop (not clickbait) (almost died) (shot my neighbors cat with a sawed off) (working 2021) (working free robux) (no survey) (no virus) simultaneously
if you mess up it's just going to sound like a loud cacophonous mess rather than a loud mess
@@KavsLockedOutLong distances in areas with lots of interference could do that easily. Networks of low power devices (not full computers) that can't afford to be constantly transmitting - to name two situations.
A slightly different situation is in digital logic circuits - a circuit built on the transistor level. Memory requires a fair number of transistors to make work, but logic states are much easier. Connecting everything to everything may not work just based on space - transistor circuits can be absurdly small.
I thought about splitting the problem along the middle of the line, but I didn't think about sending a signal that is 3 times slower than another. Beautiful solution!
Absolutely based that you brought this version back.
As a musician I very much appreciate that you synced the music, it annoys me to no end when stuff like this is put to random music that doesn't sync and it takes work to sync something like this so well, I owe my life to you.
I agree.
The only problem is that the robots dance in 3/4 and the music is in 4/4.
@@emil.pettersson05 that's called an ostinato, looks like it's intentional here, so no problem :)
@@emil.pettersson05 anything can be a waltz if you try hard enough
How do you want to pay?
Now we just need twenty people to learn the choreography for this and do it as a stage performance.
The audience might not like the plot twist at the end.
@@hueyiroquois3839 Dead men tell no tales
@@hueyiroquois3839 What are they gonna do about it?
@@hueyiroquois3839 Maybe, but they won't live to tell the tale. (Hides mousin negate behind back)
...why... 🤦♂️
This will probably get recommended again over 6 years. See ya there.
I love how more rules kept being added so that when he was wrong, he wasn't wrong
I like that the leg signal is basically the countdown. In the time it takes for it to move from the first to the last robot, all the other signals would have been set to fire
Not quite. If a robot becomes a double-general while queuing the leg signal, the leg signal is delayed by one beat.
@@DJChiefX197 The point still stands, since the final robot only fires when that final leg signal reaches the end of the line.
@@ryannorthup3148 heh, the point still _stands_
@@ValeBridges heh
@@ryannorthup3148 Puns!
Executioner: "If you can figure out how to make this robot firing squad fire simultaneously using only body language from neighbors, we'll commute your sentence."
Prisoner: "Logic problem? Ugh, just kill me."
*robots dance*
Prisoner: "Ohhhh, that's ho- *LASERED*
This is a perfect example of a more advanced Turing machine. Great video
Thanks for posting. This is just about the proudest I've ever been of solving a logic puzzle. The crazy thing is that as complicated as the solution is, most of it is actually forced by the constraints of the puzzle. There are a few different ways of dealing with parity issues. But most parts of the solution are provably required.
8:05 Imagine this is the last thing you see before you die.
id die amused and that wouldnt be terrible lol
They be groovin'
I'd be pretty amused
Imagine a future where they need 20 coordinated robots to kill you.
sometimes I come back to this video just to watch from 8:05 onwards
Imagine being sentenced to death by firing squad during the robot uprising, and your last sight is a bunch of robots dancing to coordinate your demise
Good TH-cam algorithm! A video I would have never found but needed.
I cannot stop laughing at the idea of someone who’s been sentenced to death by robot firing squad, screaming bloody murder while these robots just boogie down to upbeat royalty free music
Can we have 10 hours of these robots please
Yes just a stream where after firing it adds another robot
@@walksanator 10/10 would watch
Please
follow up problem: "at 2 beats per second, what number of robots would take (closest to) 10 hours to fire?"
@@walksanator Oh that's a nice programming challange
as a programmer the only issue I see is giving them a beat that is perfectly synchronous so we can do this fast
@TailExchange can you trust that clock tough? are you sure your thread is not pushed to the back and almost forgotten about when the others are having fun.
or when you're communicating with other systems and somehow their message takes a freaking long time to arrive...
I'm not stressed working with multi-threaded web services, what are you talking about :p
I want to see a simulation where each robots propagate their signal at very slightly different rate and see how bad the desync is gonna be..
@@Elizhium maybe set a time when the beat should start and have a hardcoded beat?
If you had a server, you wouldn’t need the dancing.
If every robot can measure time and can perform actions instantly, it should be pretty easy - every robot performs action exactly on beat, to act as a basic synchronous clock.
Before starting the execution dance, they sync their clocks. The leftmost robot sends out a sync signal with no information. It gets passed like the "hand up" signal in the video, bounces back and comes back to the leftmost robot. Every robot automatically syncs their clock to the robot left of them.
Only after leftmost robot receives the returned sync signal, the main execution dance begins.
I could watch these full runs for hours. It's hypnotizing.
n=17 is my favorite. The pirouettes and the high notes make me giggle.
Maths is beautiful AND deadly. I love it.
Meanwhile in terminator 5:
„Mom? Why are the robots dancing?“
„Oh no, we are dead in 20 seconds! Give me one last hug“
„I love you mom“
„I love you son“
....
One eternity later
Piu piu piu
A Group Of Rebels Moves The Robots From The Beginning To The End Cyclically, Resulting In Them Being Completely Relocated.
@@AssistantCoreAQI „Error, arm signal from right == True and left leg stretched == True not found! Nuclear self destruct in 3, 2, 1“
Ive seen this algorithm before with just colored cells, but its so much easier to visualize with the robots.
The last bit with the music just had me smiling crazily and don't know why, it bought a lot of happiness
Great, now I know a solution to a problem I haven't heard of before!
"Many years later, as he faced the firing squad, Colonel Aureliano Buendía was to remember that distant afternoon when his father bonked a robot on the head"
-one hundred years of solitude
i like how they have to get hit in the head with a squeaky hammer to activate
This is also a decent example of how a resonance chamber works if you think of each limb position as a harmonic series
Middle of an odd squad general is an absolute chad. Coolest robot in the squad by far
The best part of this is that there's actually a practical application for simultaneous mechanisms. As long as their clocks are synchronized, pinging the nearest two devices with your state and updating accordingly should allow for simultaneous firing of whatever thing needs to be simultaneous. And if you put it in a machine, the order could carry across the line and back nearly simultaneously!
Mmmm, except you fail at the synchronized clocks. Alternatively, you already had a method to synchronize all devices.
"there's actually a practical application for simultaneous mechanisms"
"whatever thing needs to be simultaneous"
Sorry bud but you're not making the greatest point.
This argument does prove however that this could happen in real life, so it is a step toward making this useful.
This is fragile because it supposes that all of your machines are reliable.
Almost as though almost every analogue mechanical device is consistently simultaneous, and this is a superflulous example. You've really not said anything here that isn't already implied, and frankly I've lost some faith in the intelligence of humanity.
@@loganduncan1259 This is an example of swarm behavior, try again.
Two uploads in a century? God has blessed us
So glad TH-cam answers questions i didnt know I wanted to ask
Here I was trying to solve the problem not knowing you could have a leg and a arm state separate from one another, you made it sound and look like it was all one state.
For some reason this is the funniest thing I've seen this week.
Thought this was going to be an impossible problem, but it wasn't. Very neat!
hello merge sort type solution, very cool to see you here!
At first I was having trouble grasping it, but everything came together by the. Then I just watched it several more times because it's such a fun video.
The mathematical precision of them trying to decide when to kill you is so detached it’s scary. But also I want to dance
Why the leg has three stages: the hand signal must travel three times faster than the leg signal because it has to travel three halves while the leg signal only one so that they meet in the middle.
Thank you!
good comment.
That's genius!! Thanks for explaining it to my stupid mind! Now I can truly appreciate the solution!
And multiple leg signals to handle even or odd amount of squad members since with an odd amount you will have a single person in the middle but with an event amount there will be 2 middle men
Its like a terrifying robot timer.
You know its getting closer to shooting you, but you never know exactly when it will
This video went straight over my head… but I loved it
Wow, this is a really clever solution, and the procedural animations are impressive! Thank you!
Wow, this is probably the most clever logic puzzle I’ve ever seen.
This is one of those lesson introductions one of my old professors would use right before launching into the history of statistical mechanics and how simple models can show phase changes in materials.
The robot dance number of death!
Glad to see you showed it with primes too.
All the while, whatever was in the path of 100 robots decided to take a nap and then just leave
Such a fascinating problem and solution!
mathematicians are the type of guys to go "heres a simple problem" and then add 20 more rules once you get it right
I love finding such random videos
Wow blue moon today, udiprod uploads
It's always a great day!
Imagine a army battle vs 2000 or so of these guys
And the enemy is polite enough to wait for them to finish
"Alright, Alright, I'll Wait A Week For You All To Align.. -Sigh.- Someone Knocked The Middle One Over, We Have To Restart It."
the explanation for this logic problem is so convoluted
uncanny how cheerful the video is for being about a firing squad
It looks like those Wolfram cellular automata, but with finite set of cells in the horizontal axis and with more than 2 states.
It means that this is just 1D automata.
@@charlz-darvin Yes, like all wolfram's automata
@Michael Darrow I know. But Wolfram studied the 2 states 1 dimensional and infinite cells cellular automata. The video shows us a 1 dimensional, finite cells and more than 2 states.
4:56 when you find the nerf dart that you lost in 2010
I keep forgetting about this video and then it pops up again in my recommended a random day
these videos are unbelievably interesting to watch and think about
I like how the music and the dancing is all cute to watch, but what they're actually doing is getting ready to kill you, since your point of view is that of the condemned. XD
"I love these random educational videos from years ago this is from what? 6 years ago?"
> Last week
Imagine being sentenced to death and you see a firing squad dancing to happy music before they all shoot.
You can see the wave mechanics. Awesome video
It's amazing to see how people can find ways to emulate things like memory and recursion in such simple and restricted systems like this.
Lmao "this is a robot firing squad" being the first thing, sounds like Mark Zuckerberg and his buddies dislike my being alive.
6:40 when the laser sound effect said "ch" i felt that
pw ch zzt
The enemy squad when they catch me reloading:
The new rhythm heaven game looks amazing!
the visual cues seem a bit complicated
I'm not gonna get better then a OK
Woah, more than one video posted in a year? THIS IS AMAZING!!!
"We have some constraints that make this simple task difficult"
Typically those constraints are emotions.
0:00 "Heres a robot firing squad" in a happy and upbeat tone
This has to be the most upbeat tune I've heard while being executed by firing squad
I loved this puzzle! Great visualization as always, I'm looking forward to the next video!
imagine being executed and the firing squad does a little jiggle before killing you
That is so interesting. Really loved the video
I have a copy of the 'Computation' book by Minsky-- college text book. This problem is basically the only thing I specifically remember from the book and it has always intrigued me. When I saw the video title I knew immediately what the topic was about. I'm still, to this day, curious what the 2n-2 step solution is. The book claims the soldiers in that solution have 1000's of states, but the link in the description says "Optimal solution: The fastest solution to this problem uses 2n-2 steps. There’s a proof this is the best possible time.
It uses also only 6 states. It is not known whether this is optimal or not."
This excellent! Very well presented, and it brought back happy memories of reading Edsger Dijkstra's paper, "Self-Stabilizing Systems In Spite of Distributed Control", back in the day. Thank you.
I think it would have been cooler ti split the firing state into multiple states, for aesthetic purposes only. A preparation state, an aim state, and a fire state, for example. Having the entire protocol being linked to firing will make it so that nothing is changed in terms of solution, as each step must be performed in order, while also making it so that the robots don't just make an ugly snap to firing. This also makes the protocol to be played to the beat. But hey, that's just me.
A clever way to sync a state machine, visualized with robots! Awesome