The Monty Hall Problem
A treasure hunt behind three doors where switching your pick after a dud is revealed always doubles your odds of winning.
Definition The Monty Hall problem is a famous probability puzzle based on a game show with three doors: one hides a car and two hide goats. After a contestant chooses a door, the host opens one of the remaining doors to reveal a goat and offers a chance to switch. Switching doubles the winning probability from 1/3 to 2/3, dramatically illustrating how mathematical reality can defy everyday intuition.
Game Show Doors and a Puzzling Choice
Picture yourself on the brightly lit stage of a classic TV game show facing three closed doors. Behind one door shines a sleek sports car; behind the other two are goats. You nervously point to Door 1. The host, who knows exactly what lies behind every door, steps over and swings open Door 2, revealing a goat.
He smiles and asks: "Last chance. Would you like to stick with Door 1, or switch to Door 3?"
Most people assume it no longer mattersโwith two closed doors left, isn't it just a 50-50 coin flip? Amazingly, no. If you stay with your initial pick, your odds of winning remain just 1 in 3. But the moment you switch, your probability of winning leaps to 2 in 3โtwice as high.
Why Switching Doubles Your Odds
The secret behind this counterintuitive puzzle lies in your very first guess. When you picked a door out of three, your chance of picking the car was only 1/3, while your chance of picking a goat was 2/3. In other words, two times out of three, your initial choice is a dud.
Here is the crucial key: the host knows where the prize is. He never opens doors at random; he deliberately selects and opens a goat door from the ones you didn't pick.
If your first pick was a goat (a 2/3 probability), the host is forced to reveal the other goat. That leaves the sports car behind the remaining unopened door with 100% certainty. Switching effectively turns every single scenario where your first guess was wrong into an instant win.
Making It Obvious with 100 Doors
If this still feels hard to believe, imagine a hallway with 100 doors. Only one hides a luxury car, while the other 99 conceal duds. You pick Door 1. The chance you nailed the prize on your first blind try is a tiny 1 in 100 (1%).
Now the host walks down the line, opens 98 doors with duds, and leaves only Door 77 closed. Remember, the host knows where the prize is, so he purposely filtered out 98 losing doors for you.
Between Door 1 (your 1% blind guess) and Door 77, where is the car almost certainly hiding? Behind Door 77, with a massive 99 in 100 (99%) probability! When the host injects new information into the game, the odds shift dramaticallyโa classic example of conditional probability.
๐ค Common misconceptions
Since there are only two doors left, the odds are 50-50 whether you switch or not.
Because the host intentionally reveals a goat using his insider knowledge, the 2/3 probability that your initial pick was wrong gets funneled entirely into the remaining unopened door.
๐งบ Where you meet it
Because the host uses insider knowledge to eliminate a dud, switching turns your initial 2/3 chance of being wrong into a 2/3 chance of winning.