The two generals problem
Medium
Two armies on opposite hills must attack a city at the same time to win, and an army attacking alone is destroyed. The generals can communicate only by messengers who cross a valley and may be captured. Is there a protocol with a finite number of messages that guarantees the generals always attack…