|
|
![]() |
AS/A2 Stats 2 Stats 3 |
| S1 Topic 3: Probability | |
| The Monty Hall problem extended | |
| You have to find the
hidden prize, but you can choose the number of doors. Select a door. All of the
others (leading not to the prize!) apart from one 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