Monty Hall Simulator

Simulate stay and switch strategies under the classic host-knows Monty Hall rules.

The host knows where the prize is and opens only goat doors.

Speed changes presentation only, not the simulated results.

Use the same seed to replay the same run.

Stay win rate

Not run

Switch win rate

Not run

Exact stay probability
33.3%
Exact switch probability
66.7%
Trials completed
Not run

Exact probabilities stay fixed; simulation varies by seed.

Run the simulation to fill Monte Carlo metrics and convergence.

Convergence checkpoints
TrialStay winsStay rateSwitch winsSwitch rate
Export

P(stay) = 1 / doors; P(switch) = (doors - 1) / doors How?

How this is calculated

The simulator uses the standard host-knows rule set: the prize is placed uniformly, the contestant chooses uniformly, the host opens losing unchosen doors, and switching wins exactly when the initial choice was wrong.

Formula: P(stay) = 1 / doors; P(switch) = (doors - 1) / doors

Sources

  1. Wolfram MathWorld Monty Hall Problem. Wolfram MathWorld. Retrieved .
  2. Monty Hall problem bibliography. Wikipedia. Retrieved .

Method last reviewed