Monty Hall Problem Simulation

This is A REAL TIME Proof of Monty Problem written in JS.

Click on 'Check Probability'  button to get updated probability.

The Monty Hall Problem states that if you start with 3 doors (1 with treasure), you pick one and the host reveals a door with nothing behind it, Statistically you are Better to Switch (1 in 3 if you do not switch and 2 in 3 if you do).

So this simulation is effectively the same thing just using a Computer with ALOT of processing power!