# The finite state firing squad (Jacques Mazoyer's solution)

The state set is {-, A, B, C, F, G}, the quiescent state is -, the excited state is G, and the firing state is F.

The transition function is listed below, in the form of a sequence of lines, each of which contains the previous state of the machine on the left, our previous state, the previous state of the machine on the right, and our next state, in that order. ? denotes any state. If two lines conflict, use the line which comes first in the sequence. Soldiers at the end should pretend they have a neighbor in state X beyond the end.

In Mazoyer's solution, the initially excited soldier must be on the left. (In Balzer's solution, it must be on the right; in the other solutions, it can be on either end.)

```X - - -
- - X -
- - - -
- - B -
- - C -
- - G -
A - X C
A - - G
A - A -
A - B -
A - C -
A - G C
B - X -
B - - -
B - A -
B - B -
B - C -
B - G -
C - X G
C - - A
C - A -
C - B -
C - C -
C - G G
G - X A
G - - C
G - A -
G - B -
G - C -
G - G A
X A A F
X A C G
- A A A
- A B -
- A C G
A A X F
A A - A
A A A A
A A B B
A A C C
A A G B
B A X C
B A - G
B A B G
B A C C
B A G C
C A - A
C A A A
G A X C
G A C C
G A G C
- B A G
- B B B
- B C -
- B G B
A B - G
A B A B
A B B B
A B C -
B B - G
B B A A
B B B B
B B C C
B B G B
C B X -
C B - -
C B A A
C B G -
G B X G
G B - C
G B A C
G B C B
G B G G
- C - C
- C A A
- C B G
- C C C
- C G G
A C X B
A C - B
A C B B
A C G B
B C X G
B C - C
B C C C
B C G G
C C - C
C C A A
C C B B
C C C C
C C G B
G C X B
G C - B
G C B B
G C G B
X G - A
X G B G
X G C G
X G G F
- G A G
- G B G
- G C G
A G - B
A G B G
A G C G
B G X G
B G - B
B G B G
B G C G
B G G G
C G X A
C G - A
C G B G
C G C G
C G G A
G G X F
G G - B
G G B G
G G C G
G G G F
```

Back to the firing squad solution page

Last significant update 20-IX-2004