WoodCentral Forums

Est. 1998 — 27 years of woodworking knowledge

Friday Puzzler -- Information, please

Posts

Friday Puzzler -- Information, please

#1

Friday Puzzler -- Information, please

Alex Y

There are n individuals who each have a separate item of information. You need to get all this information into the hands of all the individuals, but the only means of communication is a single-recipient one-way messaging system. (Think email, but no multi-addressee emails.)

What is the minimum number of messages that must be sent to assure that each of the n individuals has all n pieces of information?

(You can pre-arrange with participants the scheme for disseminating the information, and such "meta-communication" about the communication scheme is not part of the message count.)

Re: Friday Puzzler -- Information, please

#2

Re: Friday Puzzler - questions

Larry Barrett

Can we assume that messages need not be sent simultaneously?

Can we assume that if B receives message a from A, B can send both message a and message b to C?

Re: Friday Puzzler -- Information, please

#3

Re: Friday Puzzler - questions

Larry Barrett

Assuming that the answer to both questions is yes, then the number 2 appears twice in the answer.

Re: Friday Puzzler -- Information, please

#4

Re: Friday Puzzler - questions

Alex Y

Can we assume that messages need not be sent simultaneously?
Yes. The messages need not be (and if fact are not) sent simultaneously.

Can we assume that if B receives message a from A, B can send both message a and message b to C?
Yes, if I understand you correctly. But the way you describe it sounds like B is sending two messages. In fact, B sends one message containing both the information he knew at the start as well as the information he learned from A.

Re: Friday Puzzler -- Information, please

#5

Correct

Alex Y

Assuming you are not using parentheses in your answer ;)

Now, can you prove that answer is minimal?

Re: Friday Puzzler -- Information, please

#6

Re: Correct

Larry Barrett

My scheme for disseminating messages is this:

A sends his message a to B. B sends messages a and b to C (in a single message). C sends messages a,b,c to D, and so on. Thus, N receive messages a,b,c,...n-1 from N-1 which, combined with his message n means N will now have all messages. This requires N-1 messages.

N can now send all messages to A, B, C, ...N-1 - an additional N-1 messages.

Alternatively, N can send selected subsets of messages to A, B, etc, but it will still require N-1 messages.

So there are a total of 2N-2, or 2(N-1) messages needed.

Consider a different scheme, say where A sends his message a to B and to C. Then B sends message b to C. C now has messages a,b,c, but it required 3 messages to do this, rather than 2 in the scheme above.

Re: Friday Puzzler -- Information, please

#7

Nice job!


👍 This page answered my questions

Your vote helps other woodworkers quickly find the answers and techniques that actually work in the shop.