Suppose the game is played 300 times and the player always picks door 1. In 100 of those games the car is behind door 1, and switching loses every one; in the other 200 the car is behind one of the other doors, the host — who knows, and always opens a goat door — removes the only other loser, and switching wins all 200. The workbench gets 300 × 2/3 = 200 and 300/3 = 100, and 200/100 = 2: switching wins twice as often as staying.
The objection that reaches almost everyone is that after the host opens a door there are two doors left, so it must be 50-50. The count above is what answers it: the host's choice is not random, and being shown a goat transfers the 2/3 that was spread over two unchosen doors onto the one door still closed. Writing the answer as 2/3 would be a stacked fraction on this screen, which is why the version here counts games — the same 2 : 1 as two integers.
Answer
200
How to read it
300 × 2/3, the games switching wins. The second link is the 100 games where the first pick was already right, and the third is the ratio between them.
Source
The three-door problem, sent to Marilyn vos Savant's Ask Marilyn column by Craig F. Whitaker and published on 9 September 1990, where the switch wins with probability 2/3; the frequentist form is the standard resolution — over many games the host's reveal moves two of every three wins to the other door
Work it in the calculator
These links open the right calculator with this problem's numbers already typed in. The line above is what the screen should show — check it yourself.