H. E. Dudeney, Amusements in Mathematics (1917) No. 265 · Puzzles · Logic
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.
H. E. Dudeney, Amusements in Mathematics (1917) · No. 265
Stuck? A gentle nudge
No hints for this one.
Your working
Check your full solution
Attach photos of your pages (up to 3) or one PDF — or check what you typed above. Lemma reads the work and verifies the reasoning, not just the answer.
Your first check today doesn't need an account.
Your photos and PDFs are read once and not stored — only the transcription is kept.