Assumptions

• There are enough loyal generals, that is, N ≥ 3 x M + 1.

• Each loyal general executes the correct algorithm.

• Each general can send an oral message to any other general.