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 'Star maps using Blender'

Thread 'Star maps using Blender'

Blender just recently dropped a new version, 4.5(with 5.0 on the horizon), and within it was a new feature for which I immediately thought of a use for. The new feature was a .csv importer for Geometry nodes. Geometry nodes are a method of modelling that uses a node tree to create 3D models which offers more flexibility than straight modeling does. The .csv importer node allows you to bring in a .csv file and use the data in it to control aspects of your model. So for example, if you...
View full post »

Similar threads

What is Baseband RF communication?
Replies
5
Views
1K
MHB Is the list a circular shift of the other?
Replies
2
Views
2K
MHB Modify Triangle Program #2 - Enter Valid Sides for Area
Replies
15
Views
3K
Total security communication system
Replies
4
Views
2K
MHB Convexivity issues in a new type of network - NLP
Replies
1
Views
3K
MHB (Seemingly) Random Sequences
Replies
7
Views
2K
How do you solve for P in a separable equation involving multiple variables?
Replies
1
Views
3K
MHB Finding a Minimal Vertex Cover & Max Sets for a Graph
Replies
2
Views
2K
Is There a Flaw in this Turing Test Reasoning?
Replies
9
Views
2K
MHB Probability to get the correct message
Replies
15
Views
2K

Hot Threads

Recent Insights

Back
Top