The Monty Hall Problem
Conditional Probability, Bayes' Rule, and Why Switching Wins Two Out of Three — A TLDR Primer
You've heard the puzzle in class or on a podcast: three doors, one car, two goats, and a host who knows where the car is. Switch or stay? Most students (and most professors, famously) guess 50/50 and get it wrong — and the explanations online either wave their hands or bury the answer in dense textbook notation.
This TLDR primer walks through the Monty Hall Problem the way a good tutor would: state the puzzle precisely, show why the obvious answer feels right but isn't, then prove — three separate ways — that switching wins two times out of three. You'll enumerate the cases by hand, track where the car 'really is' after a door opens, and see the logic snap into focus with the extreme version of the puzzle using a hundred doors instead of three. From there it builds the formal machinery: conditional probability notation and Bayes' Rule, treating the host's choice of which door to open as evidence you update on — the same reasoning used in medical testing, forensics, and machine learning.
Along the way it covers the variants that trip people up even after they've seen the proof — the Monty Fall problem, the Monty Crawl problem, and what happens if the host doesn't know where the car is — so you understand not just the answer but why the exact rules of the game matter.
Written for high school and early-college students working through probability and statistics, and just as useful as a probability puzzle homework help session for a parent or tutor prepping to explain it. Short by design, no filler, stripped to the reasoning that actually matters.
Open it, work the three proofs, and never lose an argument about goats and doors again.
- State the Monty Hall Problem precisely, including the host's rules
- Explain why the naive 50/50 intuition fails
- Compute the winning probabilities for 'stay' and 'switch' three different ways: enumeration, conditional probability, and Bayes' rule
- Generalize the result to N doors and to variant host behaviors
- Recognize the same reasoning pattern in real-world problems
- 1. The Puzzle and Why It Feels WrongSets up the game show scenario, states the problem precisely, and explains the near-universal wrong intuition.
- 2. The Rules Matter: Making the Problem PreciseSpells out the exact host behavior that makes the standard answer correct, and shows how changing the rules changes the answer.
- 3. Three Ways to See That Switching Wins 2/3Proves the result by direct enumeration of cases, by tracking where the car 'is' after the host opens a door, and by the extreme case of 100 doors.
- 4. The Formal Solution: Conditional Probability and Bayes' RuleDerives the 2/3 answer using conditional probability notation and Bayes' theorem, treating the host's action as evidence.
- 5. Variants, Generalizations, and Common TrapsExplores N-door generalizations, the Monty Fall problem, the Monty Crawl problem, and student misconceptions that persist even after the proof.
- 6. Why It Matters Beyond the Game ShowConnects the puzzle to Bayesian reasoning in medicine, forensics, and machine learning, and shows why updating on evidence is a general skill.