Problem: 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.

Solutions: 1


Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs
non-Github:
@H-Dudeney


References

Project Gutenberg

  1. Dudeney, H. E.: "Amusements in Mathematics", The Authors' Club, 1917

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.