Puzzles and Paradoxes

Classic Probability Puzzles and Why They Trick Us

A tour of famous probability puzzles, from Monty Hall to the birthday problem, and the intuitive trap each one sets for even careful thinkers.

On this page
  1. Why intuition and probability disagree
  2. Puzzles where information changes the odds
  3. Puzzles where counting goes wrong
  4. Puzzles about averages and groups
  5. Puzzles about comparison and choosing
  6. What the puzzles have in common
  7. How to approach a new puzzle
  8. A note on gambling

Why intuition and probability disagree

Most famous probability puzzles are famous because nearly everyone’s first answer is wrong, and wrong in the same way. The errors are not random. They come from a small set of habits: treating unequal cases as equal, ignoring how a piece of information was obtained, comparing the wrong quantities, or expecting averages and rankings to behave the way they do for ordinary numbers.

Learning which habit each puzzle exposes is more useful than memorising the answers. This overview sets out the standard puzzles and the trap each one sets. Each has its own article with the full working.

Puzzles where information changes the odds

The Monty Hall problem is the best known. A contestant picks one of three doors, and the host, who knows where the prize is, opens a different door that hides no prize and offers a switch. Under the standard rules, switching wins two thirds of the time. The trap is the thought that two doors remain, so each must be 50/50. That ignores that the host’s choice was constrained by what he knew.

The Bertrand box paradox has the same shape with coins in boxes. You draw one gold coin from a randomly chosen box, and the question is whether the other coin in that box is also gold. The answer is two thirds, not one half, because drawing a gold coin makes the box with two gold coins more likely than the mixed box.

The two child problem and its sibling, the Tuesday birthday puzzle, push the idea further. Whether you are told “at least one is a boy”, “the older one is a boy” or “one is a boy born on a Tuesday” changes the answer, even though the sentences sound almost identical. All of these are exercises in conditional probability: the question is always what remains possible once you know what you know, and how you came to know it.

Puzzles where counting goes wrong

The birthday problem asks how many people are needed before a shared birthday is more likely than not. Most people guess something close to 183, half of 365. The real answer is 23. The trap is imagining one fixed birthday that must be matched, when any pair among the group can match. The calculation is easiest through the complement rule: find the chance that nobody shares a birthday, then subtract from one.

Puzzles like this are why careful counting principles matter. When the number of pairs grows much faster than the number of people, intuition built on small groups fails.

Puzzles about averages and groups

Simpsons paradox shows a trend that appears in every subgroup yet reverses when the groups are combined. A player can have a better win rate than a rival in every game mode and still have a worse rate overall, because the two play the modes in very different proportions. It is a standard warning about cherry-picked statistics and about what a combined average hides.

The St Petersburg paradox is a different kind of surprise. It describes a coin game whose expected value is infinite, yet almost nobody would pay more than a modest amount to play. The puzzle forces a question about what expected value actually measures, and why a long-run average is not the same thing as a sensible price for a single play.

Puzzles about comparison and choosing

Non-transitive dice break a habit we rarely notice: if A beats B and B beats C, we assume A beats C. With the right dice, A beats B, B beats C, and C beats A, each with the same probability above one half. Penneys game is the coin-flip version. Two players pick different three-flip sequences, and the player who chooses second can always select a sequence that is more likely to appear first. Neither coins nor dice are biased; the structure of the game creates the cycle.

The secretary problem, studied under the heading of optimal stopping, asks how to pick the best option from a sequence seen one at a time, when you cannot go back. The best simple rule is to look at roughly the first 37 percent without choosing, then take the first option that beats all of those. It does not guarantee the best choice, and it only succeeds a little over a third of the time for long sequences, but it beats choosing at random.

What the puzzles have in common

A few habits help with nearly all of them:

  • State the assumptions. Many disputes about these puzzles are really disputes about unstated rules, such as whether the host must always open a door.
  • List the equally likely cases explicitly, then count. A table of outcomes settles most arguments.
  • Ask how the information arrived, not only what it says.
  • Compare like with like. Win rates, group sizes and averages can mislead when the groups differ.
  • Check by experiment when in doubt. A Monte Carlo simulation of a few thousand trials is often convincing where words are not.

How to approach a new puzzle

When a puzzle seems to have an obvious answer and a famous reputation, the obvious answer is usually the trap. A useful routine is to write down what is known, name the equally likely starting cases, remove the ones the information rules out, and only then count. If the result disagrees with your instinct, do not simply trust the algebra or the instinct: test it with a small table or a quick experiment. Over time, the same few patterns, such as hidden weighting, overlapping pairs and uneven groups, begin to look familiar, and the puzzles become easier to spot in real statistics about games and sport.

Disagreement about an answer is also worth taking seriously. Several of these puzzles have caused long arguments among capable people, and often the cause was an unstated assumption, not an arithmetic slip. Agreeing on the exact rules first settles many of the debates before any numbers are calculated.

A note on gambling

These puzzles are about reasoning, not about systems for winning. Casino games carry a house edge, each spin, deal or flip is independent of those before it, and the gambler’s fallacy is the belief that past results change what comes next. None of the puzzles above gives a way to beat a game with a negative expected value. Gambling can cause real harm; anyone who feels they are losing control of it should consider contacting a local support service.

The best use of a puzzle is as a small, safe place to practise careful thinking, where being wrong costs nothing and the correct answer can be checked.

Keep exploring

Guides from other topics

All topics →