  We consider the firing squad synchronization problems for paths in the two
and the three-dimensional grid spaces. Minimal-time solutions of these problems
are not known and are unlikely to exist. However, at present we have no proofs
of their nonexistence. In this paper we show one result that suggests what type
of study is necessary in order to prove their nonexistence.
