4 ms·
I don’t think you do. Imagine the Monty hall problem had 1,000 doors. You choose one, then 998 others are opened to reveal goats. It’s abundantly clear that swi
by garmaine 9y ago
I don’t think you do. Imagine the Monty hall problem had 1,000 doors. You choose one, then 998 others are opened to reveal goats. It’s abundantly clear that switching in this case is better odds, without even formalizing the mathematics.
- carlmr 9y agoLook at kqr's comment, which shows why this is not an equivalent problem, and also points out that questioning it is quite right in this case.
- garmaine 9y agoIt is an equivalent problem. kqr's comment is wrong in its implications. Whether you open one door or 998 doors, you are revealing information about the likelihood of what is behind the last door. It's just more obvious that this is the case when N-2 doors are opened than just one.