The Monty Hall Problem Explained: Why Switching Doors Wins

Three doors, one car, two goats. Should you switch? The Monty Hall problem fools almost everyone. Here is the answer, three ways to see why, and the assumptions that matter.

By Lavish Sethi · · 5 min read

The Monty Hall problem is one of the most famous brain teasers in probability, and one of the most argued about. It sounds simple, yet the correct answer strikes most people as obviously wrong the first time they hear it. Let us walk through the puzzle, the answer, and several ways to make it feel intuitive.

The puzzle

You are on a game show. In front of you are three closed doors. Behind one is a car; behind the other two are goats. You pick a door, say Door 1.

The host, who knows where the car is, opens one of the other two doors, say Door 3, to reveal a goat. He then asks: "Do you want to stick with Door 1, or switch to Door 2?"

Should you switch?

The answer

Yes. Switching wins the car two times out of three. Sticking wins only one time in three.

Most people's instinct says it should be 50-50: there are two doors left, one car, so each must be equally likely. That instinct is the trap.

The puzzle takes its name from Monty Hall, the long-time host of the American game show Let's Make a Deal. It became famous in 1990 when columnist Marilyn vos Savant answered it in Parade magazine, said you should switch, and received a flood of letters insisting she was wrong. She was right.

Way 1: Your first pick is probably wrong

When you first choose, you have a 1 in 3 chance of picking the car, and a 2 in 3 chance of picking a goat.

  • If you picked the car (1/3 of the time): switching loses.
  • If you picked a goat (2/3 of the time): the host must open the other goat door, because he never reveals the car. The only remaining closed door has the car. Switching wins.

So switching wins whenever your first pick was wrong, which happens two-thirds of the time.

Way 2: List every case

Suppose the car is behind Door 1 (the logic is identical wherever it is). Look at what happens for each possible first pick:

You pick Host opens Result if you stick Result if you switch
Door 1 (car) Door 2 or 3 Win Lose
Door 2 (goat) Door 3 Lose Win
Door 3 (goat) Door 2 Lose Win

Sticking wins in one of three equally likely cases. Switching wins in two.

Way 3: Imagine 100 doors

Now scale it up. There are 100 doors, one car and 99 goats. You pick Door 1. The host, who knows where the car is, opens 98 of the other doors, all goats, leaving just your door and Door 57 closed.

Would you stick with your original 1-in-100 guess, or switch to the one door the host carefully avoided opening? Most people now feel strongly that Door 57 is the better bet. It is, with a 99 in 100 chance. The three-door version works the same way, just less dramatically.

Why the host's knowledge matters

The puzzle depends on specific rules, and changing them changes the answer. The standard version assumes:

  1. The host always opens a door after your first pick.
  2. The host always opens a door with a goat behind it, never the car.
  3. The host always offers you the chance to switch.

Under these rules, the host's action gives you information. He is not choosing at random; he is forced to avoid the car.

Now consider a different version, sometimes called "Monty Fall." The host trips and accidentally opens a random other door, which happens to reveal a goat. In that case, your chance of winning by switching really is 1/2. The goat was revealed by luck, not by knowledge, so it does not concentrate the probability on the remaining door in the same way.

And if the host only offers a switch when you picked the car, trying to trick you, switching would always lose. That is why careful statements of the puzzle spell out the host's behaviour.

Try it yourself

If you are still not convinced, you are in good company; many people with strong maths backgrounds initially resisted the answer. The most persuasive approach is to test it:

  • With cards: take three playing cards, one ace (the car) and two others (goats). Have a friend act as the host who knows where the ace is. Play 30 rounds where you always switch and 30 where you always stick, and count the wins.
  • With a simple program: a few lines of code can simulate thousands of games. Switching wins very close to 66.7 percent of the time.

Doing it yourself turns an abstract argument into something you can see.

Why our intuition fails

Our brains are good at noticing how many options remain, but bad at tracking how we got there. Two doors look symmetrical, so we assume they are equally likely. But the doors are not symmetrical: one was chosen by you at random, and the other survived a process designed never to eliminate the car. Information hidden in the process is what makes conditional probability tricky, and it shows up in real life too, from medical test results to legal evidence.

If you enjoyed this, try these classics:

  • The three prisoners problem, an older puzzle with the same mathematical structure.
  • The boy or girl paradox, where the precise wording of the question changes the answer.
  • The birthday problem: in a room of just 23 people, there is better than a 50 percent chance that two share a birthday.

Key takeaways

  • In the standard Monty Hall problem, switching wins 2/3 of the time; sticking wins 1/3.
  • Your first choice is wrong two-thirds of the time, and the host's forced reveal points you to the car in those cases.
  • The answer depends on the host knowing where the car is and always revealing a goat.
  • When in doubt, simulate it with cards or a quick program.

Further reading: Wikipedia: Monty Hall problem; Khan Academy: Probability.