MHB Minimal number of successful communication

  • Thread starter Thread starter mathmari
  • Start date Start date
  • Tags Tags
    Communication
AI Thread Summary
The discussion revolves around a problem involving three armies: A, B, and C, with a mountain obstructing communication between A and B. The challenge is to determine the minimal number of times a pigeon must successfully cross the mountain for A and B to coordinate an attack against army C. A suggests that A should send a message to B indicating a planned attack, contingent on receiving confirmation from B about their own attack timing. The conversation emphasizes the need for reliable communication between A and B before launching an attack, highlighting the uncertainty of the pigeon's successful delivery across the mountain. The participants are seeking further insights on how to effectively solve the problem while ensuring both armies are synchronized in their actions.
mathmari
Gold Member
MHB
Messages
4,984
Reaction score
7
Hey! :o

I got stuck with the following exercise:

There are three armies A,B,C. Between the armies A and B there is a mountain. Only A and B together can beat the army C. A and B can only comminicate with a pigeon. But it is not sure that the pigeon gets to the other side of the mountain.
Which is the minimal number of times where the pigeon gets to the other side of the mountain??

Could you give me some hints what I am supposed t do?? (Wondering)
 
Last edited by a moderator:
Technology news on Phys.org
mathmari said:
Hey! :o

I got stuck with the following exercise:

There are three armies A,B,C. Between the armies A and B there is a mountain. Only A and B together can beat the army C. A and B can only comminicate with a pigeon. But it is not sure that the pigeon gets to the other side of the mountain.
Which is the minimal number of times where the pigeon gets to the other side of the mountain??

Could you give me some hints what I am supposed t do?? (Wondering)

Hi! (Smile)

Before either A or B attacks they will both want to know for sure if and when the other attacks.
So A must have confirmation that B received his message.

Let's say that A starts by sending a pigeon to B, saying that A will attack tomorrow at noon, but only if he gets confirmation from B, that he will also attack at the same time. (Thinking)

How does this story continue? (Wondering)
 
Thread 'Is this public key encryption?'
I've tried to intuit public key encryption but never quite managed. But this seems to wrap it up in a bow. This seems to be a very elegant way of transmitting a message publicly that only the sender and receiver can decipher. Is this how PKE works? No, it cant be. In the above case, the requester knows the target's "secret" key - because they have his ID, and therefore knows his birthdate.
Thread 'Project Documentation'
Trying to package up a small bank account manager project that I have been tempering on for a while. One that is certainly worth something to me. Although I have created methods to whip up quick documents with all fields and properties. I would like something better to reference in order to express the mechanical functions. It is unclear to me about any standardized format for code documentation that exists. I have tried object orientated diagrams with shapes to try and express the...

Similar threads

Replies
5
Views
1K
Replies
2
Views
2K
Replies
4
Views
2K
Replies
1
Views
3K
Replies
7
Views
2K
Replies
9
Views
2K
Replies
15
Views
2K
Back
Top