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.

~8 minWritten answer · compare with the solution

H. E. Dudeney, Amusements in Mathematics (1917) · No. 265

Stuck? A gentle nudge

No hints for this one.

Something off?

Workspace

Your working

Check your full solution

Upload photos of your handwritten work or a PDF, and Lemma will read it and tell you whether it's right — and where it first goes wrong if not.