# The Monty Hall Problem: Why Switching Doors Doubles Your Chance of Winning
> You pick one of three doors and the host opens a goat door. Enumeration and Bayes' theorem both push the win probability from 1/3 to 2/3, and we go on to biased hosts and n doors.
> https://rikai.mugen-giken.com/en/mathematics/math-columns/monty-hall-problem
## 0. Key points
- Behind one of three doors is a car, behind the other two are goats. After you pick a door, the host **always opens one of the remaining doors, and always one with a goat behind it**. If you then switch, your chance of winning rises from $1/3$ to $2/3$ — it **doubles**.
- The reason, in one sentence: "switching wins" and "the first pick was wrong" are **the same event**. The probability of picking wrong at the start is $2/3$, so the switching strategy wins with probability $2/3$.
- We derive the same conclusion from conditional probability (Bayes' theorem). The information carried by the door the host opens **does not update the probability of your own door** (it stays at $1/3$); it pushes only the probability of the remaining door up from $1/3$ to $2/3$.
- The problem caused an uproar not because the answer is hard, but because **the statement of the problem did not spell out the rules**. Change the host's behaviour slightly and the correct answer becomes $2/3$, or $1/2$, or $1$.
- In general, if you pick one of $n$ doors and the host opens $k$ goat doors, your original door stays at $1/n$ while each remaining door carries $\dfrac{n-1}{n(n-1-k)}$. For $n = 100$, $k = 98$ the switching strategy wins with probability $99/100$.
## 1. Motivation: a television show and ten thousand letters of protest
American television had a long-running show called *Let's Make a Deal*, hosted by a man named Monty Hall. One segment of that show, recast as a mathematics problem, has become the most famous anecdote in all of probability theory.
The problem goes as follows.
> Three doors stand in front of you. Behind one is a new car; behind the other two are goats. You pick a door. The host, who knows where the car is, then opens one of the two doors you did not pick — **one with a goat behind it** — and asks: "Would you like to change your choice?"
>
> Should you switch?
Almost everyone answers: "Two doors are left, so it is fifty-fifty. Switching makes no difference." That was my own first answer too. But the correct answer is **switch**, and the chance of winning is not fifty-fifty at all: it is **exactly twice** the chance of staying.
The gap between this answer and intuition caused an incident in 1990. In her *Parade* magazine column "Ask Marilyn", Marilyn vos Savant answered "you should switch", and roughly ten thousand letters of protest arrived. Close to a thousand of them came from people holding doctorates. Letters in the tone of "you are wrong" and "this is what happens when people who do not understand probability write about it" arrived on university mathematics department letterhead. Experts overlooking an error together is in fact not so rare. In the case of the four colour theorem, a faulty proof was believed correct for eleven years ().
There is an even more striking anecdote. Paul Erdős, one of the great mathematicians of the twentieth century, is said to have refused to accept a verbal explanation and to have yielded only after being shown the output of a computer simulation. (Paul Hoffman's biography *The Man Who Loved Only Numbers* records this on the testimony of Andrew Vázsonyi.) A man who thought about prime numbers more deeply than anyone else, tripped up by a problem with three doors. Few examples show so vividly that the difficulty of mathematics is not merely a matter of computational effort. (On the question of why mathematics is hard, see [Why mathematics is hard](/en/mathematics/math-columns/why-math-is-hard), which treats another example of probabilistic intuition going astray in .)
The problem itself was posed in 1975 by the statistician Steve Selvin in a letter to *The American Statistician*, and further back it has essentially the same structure as the "box paradox" published by the French mathematician Joseph Bertrand in 1889 (). It is, in other words, a venerable trap that has been defeating human intuition for over a century.
In this article we prove the answer completely, in two ways: first by the naive but certain method of writing out every case, then by conditional probability and Bayes' theorem. After that we take up a deeper question: **why did this problem cause such a fight?** The answer, stated in advance, is that the cause lay not in the mathematics but in the English.
## 2. Preliminaries: translating the rules into mathematics
When an argument about a probability problem gets heated, it is usually because "what is random, and with what probability" was left vague while the discussion moved on. So we begin by rewriting the everyday-language rules in a form that admits no interpretation at all. Doing this carefully is the single most important step in the whole article. It is exactly the same move as defining before answering the question "is $0.999\ldots$ equal to $1$?".
Label the doors $1, 2, 3$. We call a probability model satisfying the following five conditions the **standard rules** of the problem.
1. **The position of the car** $C \in \{1,2,3\}$ is uniformly distributed: $P(C=1)=P(C=2)=P(C=3)=\dfrac13$. Behind the other two doors are goats.
2. **The contestant's first pick** $P \in \{1,2,3\}$ is independent of $C$ (the contestant has no information about where the car is).
3. **The host knows both the position $C$ of the car and the contestant's pick $P$**, and the door $H$ he opens always satisfies $H \ne P$ and $H \ne C$. That is, the host never opens the contestant's door and never opens the car's door.
4. If two doors satisfy condition 3 (that is, if $C = P$), the host **chooses between them with probability $1/2$ each**.
5. The host always opens exactly one door and afterwards always asks "would you like to switch?". He does not decide whether to open a door based on how the contestant looks.
Conditions 4 and 5 are the parts that the everyday-language statement left out. Without stating them the problem cannot be solved. Later, in and , we shall see how the answer changes when these two are broken.
A **strategy** for the contestant is a rule determining which door is finally chosen after the host has opened a door. We consider only the following two.
- **Stay**: keep the final choice equal to $P$.
- **Switch**: make the final choice the unique door that is neither $P$ nor $H$.
For either strategy, its **win probability** is the probability that the car is behind the door finally chosen.
Let us check that the final choice of the switching strategy really is determined as "the unique door". There are three doors and $H \ne P$, so removing $P$ and $H$ leaves exactly one. The instruction "switch" is therefore unambiguous.
Finally we fix notation for conditional probability. It is exactly the definition taught in high school.
For an event $B$ with $P(B) > 0$, the **conditional probability** of $A$ given that $B$ has occurred is defined by
$$
P(A \mid B) = \frac{P(A \cap B)}{P(B)} .
$$
In particular, if $A_1, \ldots, A_m$ are mutually exclusive, $A_1 \cup \cdots \cup A_m$ is the whole sample space, and $P(A_i) > 0$ for every $i$, then the **law of total probability**
$$
P(B) = \sum_{i=1}^{m} P(A_i)\,P(B \mid A_i)
$$
and **Bayes' theorem**
$$
P(A_i \mid B) = \frac{P(A_i)\,P(B \mid A_i)}{\sum_{j=1}^{m} P(A_j)\,P(B \mid A_j)}
$$
hold.
The proviso $P(B) > 0$ at the start of this definition cannot be dropped, because there is no value one can assign to a division whose denominator is $0$ (). In the computations below, every time we write a conditional probability we check that the conditioning event has positive probability.
Bayes' theorem has an intimidating name, but all it does is reorder a computation with fractions. It reads $P(A_i \cap B)$ in two ways — "$A_i$ occurs, and then $B$ occurs" and "$B$ occurs, and of that the part where $A_i$ holds" — and sets the two readings equal.
## 3. Method 1: write out every case
We start with a proof that uses almost no machinery. A secondary-school student should be able to follow it.
Under the standard rules of , the staying strategy wins with probability $\dfrac13$.
Winning with the staying strategy means that the car is behind the finally chosen door $P$, that is, that the event $\{C = P\}$ occurs. The host's action $H$ has no bearing whatsoever on whether this event occurs: what lies behind the doors was fixed before the contestant chose, and opening some other door does not change what is behind door $P$.
So we compute $P(C = P)$. By condition 2 of , $C$ and $P$ are independent, and by condition 1, $C$ is uniform, so
$$
P(C = P) = \sum_{i=1}^{3} P(P = i)\,P(C = i \mid P = i) = \sum_{i=1}^{3} P(P = i) \cdot \frac13 = \frac13 \sum_{i=1}^{3} P(P=i) = \frac13 .
$$
In the second equality we used independence ($P(C=i \mid P=i) = P(C=i) = 1/3$), and in the last one $\sum_i P(P=i) = 1$. Hence the staying strategy wins with probability $1/3$.
What deserves attention in this proof is that **whatever the host does, the $1/3$ does not move**. Many people reason "there are only two doors left, so it must have become $1/2$", but what decreased was the number of doors, not the contents of the door you first picked. The number $1/3$ was fixed the moment you chose: it is the probability of hitting the right one of three doors blindfolded.
Under the standard rules of , the switching strategy wins with probability $\dfrac23$. It is therefore exactly twice as likely to win as the staying strategy ().
The key is the following equivalence.
**Claim**: the switching strategy wins if and only if $C \ne P$ (the first pick was wrong).
($\Leftarrow$) Suppose $C \ne P$. Then the car's door $C$ is not the door the contestant chose. Moreover $H \ne C$ by condition 3 of , so it is not the door the host opened either. Since the final choice of the switching strategy is "the unique door that is neither $P$ nor $H$", that door is precisely $C$. Hence switching wins.
($\Rightarrow$) We prove the contrapositive. If $C = P$, then the finally chosen door differs from $P$ and hence also from $C$. So switching loses.
The claim being proved, the win probability of the switching strategy is $P(C \ne P) = 1 - P(C = P)$. In the proof of we computed $P(C = P) = 1/3$, so
$$
P(\text{switching wins}) = 1 - \frac13 = \frac23 .
$$
The only thing actually used in the proof is the single point that **if you picked wrong at the start, the host has no choice but to open the one remaining goat**. This situation, in which the host has no freedom, is the moment at which information leaks. The host moves under the constraint "anything but the car", and his movement therefore tells you where the car is.
Put differently, the host did not "show you a goat"; he **told you which of the other two doors is the promising one**. The two doors you did not pick carry a combined probability of $2/3$. The host set one of those two to zero, so the whole $2/3$ collects on the other.
For those who would rather count than argue, here is a table of all the cases. By condition 2 of , the situation is symmetric in the contestant's choice, so we may fix $P = 1$ (you picked door 1). The remaining split is into three cases according to the position $C$ of the car.
| Position $C$ of the car | Its probability | Door $H$ the host opens | Stay | Switch |
|---|---|---|---|---|
| 1 | $1/3$ | 2 or 3 ($1/2$ each) | **win** | lose |
| 2 | $1/3$ | 3 (no other option) | lose | **win** |
| 3 | $1/3$ | 2 (no other option) | lose | **win** |
Staying wins only in the first row, with probability $1/3$; switching wins in the second and third rows, with probability $1/3 + 1/3 = 2/3$. This is exactly and .
Splitting into four cases so as to include the host's choice, the probability tree looks as follows.
|"1/3"| A["Car is behind door 1"]
S -->|"1/3"| B["Car is behind door 2"]
S -->|"1/3"| D["Car is behind door 3"]
A -->|"1/2"| A2["Host opens door 2"]
A -->|"1/2"| A3["Host opens door 3"]
B -->|"1"| B3["Host opens door 3"]
D -->|"1"| D2["Host opens door 2"]
A2 --> R1["Switching loses probability 1/6"]
A3 --> R2["Switching loses probability 1/6"]
B3 --> R3["Switching wins probability 1/3"]
D2 --> R4["Switching wins probability 1/3"]`} />
## 4. Method 2: measuring the update of information with Bayes' theorem
What computed is the win probability when you decide "I will switch" before the game begins. A real contestant, however, decides after seeing **which door the host actually opened**. Once the information "door 3 has been opened" arrives, what are the probabilities of doors 1 and 2? Computing this is the job of Bayes' theorem.
Under the standard rules of , suppose the contestant picks door 1 ($P=1$) and the host opens door 3 ($H=3$). Then
$$
P(C = 1 \mid P=1,\ H = 3) = \frac13, \qquad P(C = 2 \mid P=1,\ H = 3) = \frac23, \qquad P(C = 3 \mid P=1,\ H=3) = 0 .
$$
Consequently, in this situation the switching strategy (choosing door 2 instead) wins with probability $2/3$.
Below, every probability is conditioned on $P = 1$, but we suppress $P=1$ from the notation to avoid clutter.
**Step 1: prior probabilities.** By conditions 1 and 2 of ,
$$
P(C=1) = P(C=2) = P(C=3) = \frac13 .
$$
**Step 2: likelihoods (the probability that the host opens door 3 in each case).** There are three cases.
- $C = 1$. The host cannot open door 1 (the contestant's pick), and the car is there as well. He can open door 2 or door 3, and by condition 4 of he chooses between them with equal probability. Hence $P(H=3 \mid C=1) = \dfrac12$.
- $C = 2$. The host can open neither door 1 ($H \ne P$ by condition 3) nor door 2 ($H \ne C$ by condition 3). Only door 3 remains. Hence $P(H=3 \mid C=2) = 1$.
- $C = 3$. The host does not open door 3, where the car is (condition 3). Hence $P(H=3 \mid C=3) = 0$.
**Step 3: find $P(H=3)$ by the law of total probability.** Apply the law of total probability from with the exclusive partition $\{C=1\}, \{C=2\}, \{C=3\}$:
$$
P(H=3) = \frac13 \cdot \frac12 + \frac13 \cdot 1 + \frac13 \cdot 0 = \frac16 + \frac13 = \frac12 .
$$
**Step 4: Bayes' theorem.** By ,
$$
P(C=1 \mid H=3) = \frac{P(C=1)\,P(H=3\mid C=1)}{P(H=3)} = \frac{\frac13 \cdot \frac12}{\frac12} = \frac{1/6}{1/2} = \frac13 ,
$$
$$
P(C=2 \mid H=3) = \frac{P(C=2)\,P(H=3\mid C=2)}{P(H=3)} = \frac{\frac13 \cdot 1}{\frac12} = \frac{1/3}{1/2} = \frac23 ,
$$
$$
P(C=3 \mid H=3) = \frac{P(C=3)\,P(H=3\mid C=3)}{P(H=3)} = \frac{\frac13 \cdot 0}{\frac12} = 0 .
$$
The three sum to $\frac13 + \frac23 + 0 = 1$, consistent with being probabilities.
Switching in this situation means choosing door 2, so its win probability is $P(C=2\mid H=3) = 2/3$.
Looking inside the computation makes it clear where the factor of $2$ comes from. The priors were level, both $1/3$. What created the difference was the **likelihoods**. In the world where the car is behind door 1, the host opens door 3 with probability $1/2$ (he picks on a whim); in the world where the car is behind door 2, with probability $1$ (he has no alternative). This ratio $1 : 1/2 = 2 : 1$ carries straight over to the ratio of the posteriors.
The Bayesian point is that one and the same observation, "door 3 was opened", is explained better by the door-2 hypothesis than by the door-1 hypothesis. By the same logic that makes "the person who must have been there at that hour" a stronger suspect than "the person with no alibi", **the hypothesis that best explains the evidence gains points**. The number $2/3$ is the exchange rate: door 2 becomes suspicious in proportion to how little freedom the host had.
Let us compute a classical problem with the same structure. There are three boxes, each containing two coins. Box $\mathrm{GG}$ contains two gold coins, box $\mathrm{SS}$ two silver coins, and box $\mathrm{GS}$ one gold and one silver. You choose a box at random and draw one coin at random from it; it turns out to be **gold**. What is the probability that the other coin is also gold?
It is tempting to answer: "since a gold coin came out, the box is either $\mathrm{GG}$ or $\mathrm{GS}$, so $1/2$." This is wrong. Writing $G$ for the event "the coin drawn is gold", we apply Bayes' theorem from . The priors are $1/3$ for each box, and the likelihoods are
$$
P(G \mid \mathrm{GG}) = 1, \qquad P(G \mid \mathrm{GS}) = \frac12, \qquad P(G \mid \mathrm{SS}) = 0 .
$$
By the law of total probability,
$$
P(G) = \frac13\cdot 1 + \frac13\cdot\frac12 + \frac13\cdot 0 = \frac13 + \frac16 = \frac12 .
$$
Therefore
$$
P(\mathrm{GG} \mid G) = \frac{\frac13 \cdot 1}{\frac12} = \frac23 .
$$
The probability that the remaining coin is also gold is $2/3$. Note that this is identical to in both structure and numbers. The error "two options remain, hence $1/2$" has been catching humanity in exactly the same shape for more than 130 years.
## 5. Change the rules and the answer changes
Here is where the problem becomes genuinely interesting. The mathematicians who got it wrong in 1990 did not do so because they were ignorant of probability. Because **the statement of the problem failed to specify conditions 4 and 5 of **, each of them was solving a different game in his head. And indeed, a small change to the conditions changes the correct answer.
### 5.1. A host with a habit
First we break condition 4 (a fair coin when in doubt). What happens if the host has a habit of preferring to open the higher-numbered door whenever he has a choice?
Keep conditions 1, 2, 3 and 5 of and replace condition 4 by the following. When the contestant picks door 1 ($P=1$) and the car is also behind door 1 ($C=1$), the host opens door 3 with probability $q$ and door 2 with probability $1-q$, where $q \in [0,1]$ is a constant. Then
$$
P(C=1 \mid P=1,\ H=3) = \frac{q}{1+q}, \qquad P(C=2 \mid P=1,\ H=3) = \frac{1}{1+q} ,
$$
so in the situation where the host has opened door 3, switching wins with probability $\dfrac{1}{1+q}$. Likewise, in the situation where the host has opened door 2, switching wins with probability $\dfrac{1}{2-q}$. On the other hand, the win probability of the switching strategy measured before the game begins is always $\dfrac23$, whatever the value of $q$.
Below we condition on $P=1$ and suppress it from the notation. The likelihoods are as follows.
- $P(H=3 \mid C=1) = q$ (this is the assumption itself).
- $P(H=3 \mid C=2) = 1$ (by condition 3 neither door 1 nor door 2 can be opened, so only door 3 is available).
- $P(H=3 \mid C=3) = 0$ (by condition 3 the car's door is never opened).
By the law of total probability from ,
$$
P(H=3) = \frac13 q + \frac13 \cdot 1 + \frac13 \cdot 0 = \frac{1+q}{3}.
$$
Since $q \ge 0$ we have $P(H=3) \ge 1/3 > 0$, so the conditional probabilities are defined. By Bayes' theorem,
$$
P(C=1\mid H=3) = \frac{\frac13 q}{\frac{1+q}{3}} = \frac{q}{1+q}, \qquad
P(C=2\mid H=3) = \frac{\frac13 \cdot 1}{\frac{1+q}{3}} = \frac{1}{1+q}.
$$
Switching in this situation means choosing door 2, so the win probability is $1/(1+q)$.
The case where the host opens door 2 is analogous. From $P(H=2\mid C=1) = 1-q$, $P(H=2\mid C=3) = 1$ and $P(H=2\mid C=2) = 0$ we get $P(H=2) = \dfrac{(1-q)+1}{3} = \dfrac{2-q}{3}$, and
$$
P(C=3 \mid H=2) = \frac{\frac13 \cdot 1}{\frac{2-q}{3}} = \frac{1}{2-q}.
$$
Even when $q = 1$ we have $P(H=2) = 1/3 > 0$, so this too is defined, and its value is $1$.
Finally we check the win probability before the game starts. The "claim" in the proof of uses condition 4 nowhere (it uses only $H \ne C$ from condition 3 and the fact that there are three doors). Hence switching wins if and only if $C \ne P$, and the probability of that is determined by conditions 1 and 2 alone to be $2/3$. Indeed, adding the two situations with their weights,
$$
P(H=3)\cdot\frac{1}{1+q} + P(H=2)\cdot\frac{1}{2-q} = \frac{1+q}{3}\cdot\frac{1}{1+q} + \frac{2-q}{3}\cdot\frac{1}{2-q} = \frac13 + \frac13 = \frac23 ,
$$
which agrees.
In the setting of , whatever the value of the host's habit $q \in [0,1]$ and whichever door he opened, the switching strategy wins with probability at least $\dfrac12$. Equality holds only when $q=1$ and the host opened door 3, or when $q=0$ and the host opened door 2.
In the situation where the host opened door 3, the win probability is $\dfrac{1}{1+q}$ by . From $0 \le q \le 1$ we get $1 \le 1+q \le 2$, and taking reciprocals (which reverses the inequalities, these being inequalities between positive numbers),
$$
\frac12 \le \frac{1}{1+q} \le 1 .
$$
The left equality holds only when $1 + q = 2$, that is $q = 1$.
In the situation where the host opened door 2, the win probability is $\dfrac{1}{2-q}$. From $0 \le q \le 1$ we get $1 \le 2-q \le 2$, so likewise $\dfrac12 \le \dfrac{1}{2-q} \le 1$, with left equality only when $2-q = 2$, that is $q = 0$.
The practical conclusion is this: even without knowing the host's habit, **switching is always a move that is no worse**. Even in the worst case ($q=1$) switching merely drops to even odds; it never loses on balance. This general formula $1/(1+q)$ was pointed out by Morgan et al. in *The American Statistician* in 1991, and it exposed the fact that the naive answer $2/3$ actually depends on condition 4.
Morgan et al. observed that "the answer $2/3$ tacitly assumes that the host tosses a fair coin". Conversely, once the standard rules are made explicit, $2/3$ is entirely correct. Most of the 1990 controversy was therefore not a mathematical error but a **failure to agree on the setting of the problem**. This is what happens when a mathematical problem statement omits an "obviously reasonable assumption".
### 5.2. A host who knows nothing
Next we break condition 3 (the host knows where the car is). Suppose the host is new on the job, opens a door at random without knowing where the car is, and it happens to reveal a goat. This is often called the "Monty Fall" problem.
Keep conditions 1 and 2 of and replace conditions 3 and 4 by the following. After the contestant picks door 1, the host, not knowing where the car is, chooses one of doors 2 and 3 with probability $1/2$ each and opens it (so the car may be revealed). Then, conditioned on "a goat appeared behind the door the host opened",
$$
P(C=1 \mid H=3,\ \text{goat}) = \frac12, \qquad P(C=2 \mid H=3,\ \text{goat}) = \frac12 ,
$$
so the switching strategy wins with probability $\dfrac12$.
Write $E$ for the event "$H=3$ and a goat appeared behind the opened door". We compute the joint probability with $E$ for each value of $C$. The host's choice is independent of $C$, and the probability that $H=3$ is always $1/2$.
- $C=1$. There is a goat behind door 3, so $P(C=1,\ E) = \dfrac13 \cdot \dfrac12 = \dfrac16$.
- $C=2$. There is a goat behind door 3, so $P(C=2,\ E) = \dfrac13 \cdot \dfrac12 = \dfrac16$.
- $C=3$. Opening door 3 reveals the car, so $E$ does not occur: $P(C=3,\ E) = 0$.
Hence $P(E) = \dfrac16 + \dfrac16 + 0 = \dfrac13 > 0$, and by ,
$$
P(C=1 \mid E) = \frac{1/6}{1/3} = \frac12, \qquad P(C=2 \mid E) = \frac{1/6}{1/3} = \frac12 .
$$
Switching means choosing door 2, so its win probability is $1/2$.
Placing and side by side makes the difference plain. Under the standard rules we had $P(H=3\mid C=2) = 1$, whereas with an ignorant host this drops to $P(E \mid C=2) = 1/2$. **The constraint that the host avoids the car was the source of the information.** Remove the constraint and the information disappears, and the intuitive answer $1/2$ becomes correct.
So the people who insisted on $1/2$ were not entirely wrong. They were solving the Monty Fall problem. At least part of those ten thousand letters concerned not mathematics but reading comprehension.
## 6. More doors: the moment intuition becomes right
The explanation that works best on those who cannot swallow $2/3$ is to increase the number of doors to a hundred. We first prove the general case and then look at a hundred doors as a special case of it.
Let $n \ge 3$ and $1 \le k \le n-2$. The car is behind one of $n$ doors, and its position $C$ is uniformly distributed. The contestant picks door 1. The host knows where the car is and opens $k$ of the $n-1$ doors the contestant did not pick, choosing only doors without the car. The set $S$ of $k$ doors he opens is chosen uniformly among all $k$-element sets satisfying that condition.
Then, after observing the set $s$ that the host actually opened,
$$
P(C = 1 \mid S = s) = \frac{1}{n}, \qquad P(C = j \mid S = s) = \frac{n-1}{n\,(n-1-k)} \quad (j \notin s,\ j \ne 1) .
$$
In particular, the strategy of switching to one uniformly chosen unopened door other than the original wins with probability $\dfrac{n-1}{n\,(n-1-k)}$.
First the likelihoods. Let $s$ be a $k$-element subset of $\{2,\ldots,n\}$.
- $C = 1$. The host may choose any $k$ doors from $\{2,\ldots,n\}$ ($n-1$ doors), so there are $\binom{n-1}{k}$ choices, whence $P(S=s\mid C=1) = \dbinom{n-1}{k}^{-1}$.
- $C = j$ with $j \ne 1$ and $j \notin s$. The host chooses $k$ doors from $\{2,\ldots,n\}\setminus\{j\}$ ($n-2$ doors), so $P(S=s\mid C=j) = \dbinom{n-2}{k}^{-1}$.
- $C = j$ with $j \in s$. The host never opens the car's door, so $P(S=s\mid C=j) = 0$.
Let us record a relation between the two binomial coefficients:
$$
\binom{n-1}{k} = \frac{(n-1)!}{k!\,(n-1-k)!} = \frac{n-1}{n-1-k}\cdot\frac{(n-2)!}{k!\,(n-2-k)!} = \frac{n-1}{n-1-k}\binom{n-2}{k}.
$$
(Since $k \le n-2$, the binomial coefficient on the right is meaningful.) Taking reciprocals of both sides,
$$
\binom{n-1}{k}^{-1} = \frac{n-1-k}{n-1}\binom{n-2}{k}^{-1} .
$$
We call this identity the **coefficient relation** in what follows.
Next we use the law of total probability from . There are $(n-1) - k = n-1-k$ doors other than $1$ that are not in $s$, so abbreviating $\beta = \binom{n-2}{k}^{-1}$ and applying the coefficient relation to the first term,
$$
P(S=s) = \frac1n \binom{n-1}{k}^{-1} + (n-1-k)\cdot\frac1n\,\beta
= \frac{\beta}{n}\left(\frac{n-1-k}{n-1} + (n-1-k)\right)
= \frac{\beta\,(n-1-k)}{n}\cdot\frac{n}{n-1} = \frac{\beta\,(n-1-k)}{n-1}.
$$
Along the way we used $\dfrac{1}{n-1} + 1 = \dfrac{n}{n-1}$. Since $k \le n-2$ gives $n-1-k \ge 1 > 0$, we have $P(S=s) > 0$ and the conditional probabilities are defined.
By Bayes' theorem,
$$
P(C=1\mid S=s) = \frac{\frac1n \binom{n-1}{k}^{-1}}{P(S=s)}
= \frac{\frac{\beta}{n}\cdot\frac{n-1-k}{n-1}}{\frac{\beta(n-1-k)}{n-1}} = \frac1n,
$$
$$
P(C=j\mid S=s) = \frac{\frac1n\,\beta}{\frac{\beta(n-1-k)}{n-1}} = \frac{n-1}{n\,(n-1-k)} \qquad (j\ne 1,\ j\notin s).
$$
As a check: there are $n-1-k$ unopened doors other than $1$, so the probabilities total
$$
\frac1n + (n-1-k)\cdot\frac{n-1}{n(n-1-k)} = \frac1n + \frac{n-1}{n} = 1 ,
$$
which is consistent. Since all the other unopened doors carry the same probability, switching to one of them wins with probability $\dfrac{n-1}{n(n-1-k)}$.
Substituting $n=3$, $k=1$ gives $P(C=1\mid S=s) = 1/3$ and a switching win probability of $\dfrac{2}{3 \cdot 1} = \dfrac23$, reproducing . Note that for general $n$ as well, the structure survives intact: **the probability of the door picked first does not move from $1/n$**.
Take $n = 100$ and $k = 98$. You pick one door (door 1) out of a hundred. The host then opens, one after another, 98 of the remaining 99 doors, all without the car. At the end only two are left: your door 1 and the single door the host stubbornly refused to open.
By , $n-1-k = 100-1-98 = 1$, so
$$
P(C=1\mid S=s) = \frac{1}{100}, \qquad P(\text{the one door left}) = \frac{100-1}{100\cdot 1} = \frac{99}{100}.
$$
Switching wins with probability $99\%$.
In this setting nobody hesitates, because the fact that "the host opened 98 doors and yet obstinately left that one alone" is too eloquent to ignore. With three doors, the host leaves only one door unopened, so this "unnaturalness" is hard to see. That is the whole difference. What happens for $n=3$ is not one bit different from what happens for $n=100$; it is merely that $99/100$ has been diluted to $2/3$.
## 7. Exercises
Suppose there are four doors, with a car behind one and goats behind three. The car's position is uniformly distributed and you pick door 1. The host knows where the car is and opens **exactly one** of the three doors you did not pick, choosing only a door without the car (choosing uniformly when several doors are available).
Find (1) the probability that the car is behind door 1, and (2) the win probability if you switch to one of the two unopened doors chosen at random. Should you switch?
Apply with $n=4$, $k=1$. The condition $1 \le k \le n-2 = 2$ holds, so the theorem applies.
(1) $P(C=1\mid S=s) = \dfrac1n = \dfrac14$.
(2) There are $n-1-k = 4-1-1 = 2$ other unopened doors, each with probability
$$
\frac{n-1}{n(n-1-k)} = \frac{3}{4\cdot 2} = \frac38 .
$$
Switching to either one wins with probability $3/8$. As a check, $\dfrac14 + 2\cdot\dfrac38 = \dfrac14 + \dfrac34 = 1$, which is consistent.
Since $\dfrac38 = 0.375 > 0.25 = \dfrac14$, you should switch. The effect is less dramatic than the $2/3$ of the three-door case, because two doors are left closed and the probability $3/4$ is spread over both.
Take the setting of with $q = 1$. That is, the host has the habit of **always opening door 3** whenever the car is behind your door 1 and he has a choice (and you know about this habit).
(1) Find the win probability of switching when the host opens door 3.
(2) Find the win probability of switching when the host opens door 2.
(3) Verify that the weighted average of (1) and (2), with the probabilities as weights, is $2/3$.
(1) By the win probability is $\dfrac{1}{1+q} = \dfrac{1}{1+1} = \dfrac12$. Checking directly: $P(H=3\mid C=1)=1$, $P(H=3\mid C=2)=1$, $P(H=3\mid C=3)=0$, so $P(H=3) = \dfrac13+\dfrac13 = \dfrac23$ and $P(C=2\mid H=3) = \dfrac{1/3}{2/3} = \dfrac12$. Switching gives even odds.
(2) By the win probability is $\dfrac{1}{2-q} = \dfrac{1}{2-1} = 1$. This is only natural: if a host with $q=1$ opens door 2, then an event impossible in the world where the car is behind door 1 has occurred ($P(H=2\mid C=1) = 1-q = 0$). So the car is certainly behind door 3, and switching wins for sure.
(3) Since $P(H=3) = \dfrac{1+q}{3} = \dfrac23$ and $P(H=2) = \dfrac{2-q}{3} = \dfrac13$,
$$
\frac23\cdot\frac12 + \frac13\cdot 1 = \frac13 + \frac13 = \frac23 .
$$
This agrees with the pre-game win probability $2/3$ (the proof of does not use condition 4). A host with a habit does not change the total amount $2/3$ of winning probability; he only skews its **distribution** across the situations.
In the ignorant-host setting of , find the following.
(1) The probability that the door the host opens reveals the car.
(2) The win probabilities of staying and of switching, conditioned on "a goat appeared".
(3) The proportion of the time the contestant obtains the car by switching, when the game is repeated from start to finish (including the rounds in which the car is revealed).
Suppose the contestant picks door 1 and the host opens door 2 or door 3 with equal probability.
(1) The car is revealed when it is behind door 2 or door 3 and the host opens exactly that door:
$$
P(\text{car revealed}) = P(C=2)\cdot\frac12 + P(C=3)\cdot\frac12 = \frac13\cdot\frac12 + \frac13\cdot\frac12 = \frac13 .
$$
(2) By , conditioned on a goat appearing, both staying and switching win with probability $\dfrac12$. (In we computed the case where door 3 was opened, but the case of door 2 is the same computation with the labels exchanged.)
(3) Counting a round in which the car is revealed as a loss for the contestant, switching wins exactly when a goat appears and the switch is correct. By (1) a goat appears with probability $1 - \dfrac13 = \dfrac23$, and given that, the switch is correct with probability $\dfrac12$ by (2), so
$$
\frac23 \cdot \frac12 = \frac13 .
$$
With no host to carry information, the win probability falls back to the $1/3$ of a blind guess. The $2/3$ of was a bonus given by the host's constraint of avoiding the car.
**The three prisoners problem** (introduced by Martin Gardner in 1959). Three prisoners A, B and C have been sentenced to death, but it has been decided that exactly one of them will be pardoned. Who is pardoned is determined uniformly at random, and only the warden knows.
Prisoner A asks the warden: "At least one of B and C must be executed. Tell me the name of one who will be executed. Hearing it cannot add any information about my own fate." The warden agrees and answers by the following rule: if exactly one of B and C is to be executed (that is, if the other is pardoned), he names the one to be executed; if both B and C are to be executed (that is, if A is pardoned), he names B or C with equal probability.
When the warden answers "B will be executed", find the probability that A is pardoned and the probability that C is pardoned. Was A's reasoning correct?
Let $X \in \{A, B, C\}$ be the person pardoned and $Y$ the name the warden gives. The priors are $P(X=A)=P(X=B)=P(X=C)=\dfrac13$. We read off the likelihoods from the rule.
- $X = A$. Both B and C are executed, so the warden chooses with equal probability: $P(Y=B \mid X=A) = \dfrac12$.
- $X = B$. The warden does not name B, who is pardoned (by the rule he names one to be executed): $P(Y=B\mid X=B) = 0$.
- $X = C$. Of B and C, only B is executed, so the warden must say B: $P(Y=B\mid X=C) = 1$.
By the law of total probability from ,
$$
P(Y=B) = \frac13\cdot\frac12 + \frac13\cdot 0 + \frac13\cdot 1 = \frac16 + \frac13 = \frac12 .
$$
By Bayes' theorem,
$$
P(X=A \mid Y=B) = \frac{\frac13\cdot\frac12}{\frac12} = \frac13, \qquad
P(X=C \mid Y=B) = \frac{\frac13\cdot 1}{\frac12} = \frac23 .
$$
A's reasoning was **half right**. His own probability of pardon did indeed stay at $1/3$, neither rising nor falling. But C's probability jumped from $1/3$ to $2/3$. It is not that no information appeared; rather, **all the information flowed into C**.
This problem has exactly the same structure as . The correspondence is "A = the door you picked first", "B, whom the warden named = the door the host opened", "C = the door left over". The warden does not name A ($H \ne P$) and does not name the person pardoned ($H \ne C$). Even the numbers, $1/3$ and $2/3$, are identical.
## References
- S. Selvin, "A problem in probability (letter to the editor)", *The American Statistician* **29** (1975). The letter that first put the problem in print; a follow-up the same year, "On the Monty Hall problem", gives the solution.
- J. P. Morgan, N. R. Chaganty, R. C. Dahiya, M. J. Doviak, "Let's make a deal: The player's dilemma", *The American Statistician* **45** (1991), 284–287. The source of (win probability $1/(1+q)$) in this article.
- Jason Rosenhouse, *The Monty Hall Problem: The Remarkable Story of Math's Most Contentious Brain Teaser*, Oxford University Press, 2009. A book-length treatment covering the classification of variants, psychological studies and the history of the controversy.
- Marilyn vos Savant, *The Power of Logical Thinking*, St. Martin's Press, 1996. Her own compilation of the 1990 column and the letters it drew.
- Paul Hoffman, *The Man Who Loved Only Numbers*, Hyperion, 1998. Contains the anecdote of Erdős refusing to accept the answer.
- William Feller, *An Introduction to Probability Theory and Its Applications*, Vol. I, 3rd ed., Wiley, 1968 — Chapter V (conditional probability and independence). The classical textbook treatment of Bayes' theorem and of what happens when it is misused.
## Appendix: checking by simulation
**Trying for yourself the method that convinced Erdős.** If the proofs still leave you unsatisfied, the sure remedy is to make a computer play a million games. The following code runs on the Python standard library alone.
```python
import random
def trial(switch, n_doors=3):
"""Play one round; return True if it is a win."""
doors = range(n_doors)
car = random.randrange(n_doors)
pick = random.randrange(n_doors)
# the host opens, uniformly, one door that is neither the pick nor the car
openable = [d for d in doors if d != pick and d != car]
opened = random.choice(openable)
if switch:
pick = next(d for d in doors if d != pick and d != opened)
return pick == car
random.seed(2026)
n = 1_000_000
for switch in (False, True):
wins = sum(trial(switch) for _ in range(n))
print(f"switch={switch}: {wins / n:.4f}")
```
Staying comes out around $0.333$ and switching around $0.667$. With a million rounds the statistical fluctuation settles down around the third decimal place.
But this experiment is meaningful only because the proof of is already in hand. The experiment itself is no substitute for a proof. There are problems, such as the Collatz conjecture, that have been verified for every number up to $2^{68}$ and yet remain open ().
**Where the mathematics sits in the code.** The line to look at is the one that builds `openable`. Writing `d != car` there is exactly condition 3 of (the host does not open the car's door). Drop that condition, rewriting the line as
```python
openable = [d for d in doors if d != pick]
```
and discard as "void" the rounds in which `opened == car`, and you obtain the ignorant host of ; the switching win probability falls to about $0.5$. Seeing in code that a single conditional expression separates $2/3$ from $1/2$ is perhaps the greatest lesson of this problem.
**Adding doors.** Set `n_doors=100` and rewrite the code so that the host opens 98 doors, and the $0.99$ of is reproduced. Since the code above has the host open only one door, for the $n$-door version you should select 98 doors from `openable` with `random.sample`. Running the experiment once you already know the answer gives you a tangible feel for the fact that probability really is a long-run proportion.