MHB Minimal number of successful communication

  • Thread starter Thread starter mathmari
  • Start date Start date
  • Tags Tags
    Communication
Click For Summary
SUMMARY

The discussion revolves around a communication problem between two armies, A and B, separated by a mountain, needing to coordinate an attack against a third army, C. The only means of communication is a pigeon, which may not always successfully deliver messages. The minimal number of successful communications required for A and B to confirm their coordinated attack is the focus, with A needing to send a message to B and receive confirmation before proceeding. The solution involves strategic messaging to ensure both parties are aligned on their attack plans.

PREREQUISITES
  • Understanding of basic game theory concepts
  • Familiarity with communication protocols in strategic scenarios
  • Knowledge of problem-solving techniques in combinatorial scenarios
  • Ability to analyze conditional statements and their implications
NEXT STEPS
  • Research game theory applications in military strategy
  • Explore communication protocols in distributed systems
  • Study combinatorial optimization problems
  • Learn about decision-making under uncertainty
USEFUL FOR

This discussion is beneficial for strategists, game theorists, military planners, and anyone interested in communication challenges in competitive environments.

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)
 
We have many threads on AI, which are mostly AI/LLM, e.g,. ChatGPT, Claude, etc. It is important to draw a distinction between AI/LLM and AI/ML/DL, where ML - Machine Learning and DL = Deep Learning. AI is a broad technology; the AI/ML/DL is being developed to handle large data sets, and even seemingly disparate datasets to rapidly evaluated the data and determine the quantitative relationships in order to understand what those relationships (about the variaboles) mean. At the Harvard &...

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
845
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K