Free puzzles / Question / Combination and Group Problems
A Puzzle For Card-Players.
Twelve members of a club arranged to play bridge together on eleven
evenings, but no player was ever to have the same partner more than
once, or the same opponent more than twice. Can you draw up a scheme
showing how they may all sit down at three tables every evening? Call
the twelve players by the first twelve letters of the alphabet and try
to group them.
Answer
Call the men A, B, D, E, and their wives a, b, d, e. Then they may play
as follows without any person ever playing twice with or against any
other person:--
First Court. Second Court.
1st Day | A d against B e | D a against E b
2nd Day | A e " D b | E a " B d
3rd Day | A b " E d | B a " D e
It will be seen that no man ever plays with or against his own wife--an
ideal arrangement. If the reader wants a hard puzzle, let him try to
arrange eight married couples (in four courts on seven days) under
exactly similar conditions. It can be done, but I leave the reader in
this case the pleasure of seeking the answer and the general solution.