|
|
![]() |
AS/A2 Stats 2 Stats 3 |
| S1 Topic 3: Probability | |
| The Monty Hall problem | |
| You have to find the
hidden prize. First choose a door. One of the others (leading not to the
prize!) will then be indicated. You can then choose to either keep your
original choice or swap to the other door. What is the best tactic? Always stick with your original choice? Always swap? Or does it make any difference? What are the probabilities of winning? |
|
an applet from
Project
Interactive, Shodor Educational Foundation