3 ms·
It is meant for things like a network, but to make the analogy work I will provide a scenario. The imaginary Red Army, and the Imaginary Blue army were both be
by drakaal 13y ago
It is meant for things like a network, but to make the analogy work I will provide a scenario.
The imaginary Red Army, and the Imaginary Blue army were both being attacked by the Green army. After waging a long war the Red army and Blue army arrive at the capital of the Greens. The Red and Blue Armies have never met, and are only united by their hatred of the Greens.
The only way for the Greens to be defeated is for the Reds and Blues to attack on two fronts simultaneously.
- dclowd9901 13y agoNo. I get point of the problem, but what I don't get is how it would be considered unsolvable. I mean it seems like it should be solvable through protocol, which this link doesn't seem to explain how it can't.
- dllthomas 13y agoIn a network, "be in the same place" is not a real solution. Try laying out a protocol in terms of messages passed, and you'll see the issue. My attempt at an explanation: At any given point, one general has less information than the other. When I send a message I learn that I've sent a message, but I don't know that they've received the message. When I receive a message, I learn both. If there is any specific threshold of knowledge required to go, one general must pass it first.