WoodCentral Forums

Est. 1998 — 27 years of woodworking knowledge

Friday Puzzle -- Dinner plans

Posts

Friday Puzzle -- Dinner plans

#1

Friday Puzzle -- Dinner plans

26 friends, conveniently named A, B, C, ..., Z, formed a dinner club, in which they dine at a large circular table that seats all of them. They meet weekly, and with the goal of getting all of the members to know each other, have decreed that each week, every member must sit tween two people who they have never sat beside before. How long will it be before all members have sat next to all other members? You may assume some absences if that gives you the optimal answer. (If any member(s) is (are) absent, the place settings are spread out, so everyone still has a right and left neighbor).

Re: Friday Puzzle -- Dinner plans

#2

Re: Friday Puzzle -- Dinner plans

I have a guess, but I cannot make it because I have Triskadekaphobia.

Re: Friday Puzzle -- Dinner plans

#3

No :-(

But the answer is much more straight-forward than you might think.

Re: Friday Puzzle -- Dinner plans

#4

Re: Friday Puzzle -- Dinner plans

Considering that: Each person needs to sit next to 25 other people. He can sit next to two per night. The shortest possible time would be 13 nights - provided you can come up with an algorithm to generate 13 sequences that satisfy the 'never sat beside before' criteria.

But a strict applicaton of that requirement creates a problem: Each person needs to meet exactly 25 other people. At each seating, he/she will be seated between 2 people. After 12 seatings, an individual will have exactly one person left to meet. But the circular seating arrangement dictates that he/she will have to sit next to at least one 'old' friend.

Re: Friday Puzzle -- Dinner plans

#5

Correct -- trick question ;-)

Re: Friday Puzzle -- Dinner plans

#6

However... ;-)

Per the original question, people can be absent to get the answer. using this, you get 12 weeks to meet the first 25. Then, you can have weeks where everyone is absent except the two that need to meet. This will take 650 weeks (26 taken two at a time), so you could do it in 662 weeks or a bit over 55 years. This does take a bit of liberty with the "between" criteria.

Re: Friday Puzzle -- Dinner plans

#7

Re: However... ;-)

Per the original question, people can be absent to get the answer.


That's what I get for trying to make the problem harder! As I originally saw it, it was 22 people, and no mention of possible absences. But this crew is too good, so I added the possible absences as a distraction.

using this, you get 12 weeks to meet the first 25.

Presuming you mean the first 24, I assume you are right. But the seating algorithm is not immediately obvious to me.

Then, you can have weeks where everyone is absent except the two that need to meet. This will take 650 weeks (26 taken two at a time), so you could do it in 662 weeks or a bit over 55 years.

I think you are over-complicating this case. If everyone has sat next to 24 others in the first 12 weeks, you have only 13 meetings to arrange, so only an additional 13 weeks of the two-person dinners.

This does take a bit of liberty with the "between" criteria.

Particularly the "two people" part of "between two people". ;-)

👍 This page answered my questions

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