1 problem

Let $\mathrm{SH}[k]$ denote the firing squad synchronization problem for squares with $k$ holes, and let a minimal-time solution mean a finite automaton that synchronizes every nod…