(related to Problem: A Tennis Tournament)
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:—
| Day | First Court | Second Court |
|---|---|---|
| 1st Day | $A d$ against $B e$ | $D a$ against $E b$ |
| 2nd Day | $A e$ against $D b$ | $E a$ against $B d$ |
| 3rd Day | $A b$ against $E d$ | $B a$ against $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.
This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this edition or online at http://www.gutenberg.org. If you are not located in the United States, you'll have to check the laws of the country where you are located before using this ebook.
