Monty Hall problem: Difference between revisions
m
→Extensive Solution: better position for the note
m (→Extensive Solution: only a minor commentary) |
m (→Extensive Solution: better position for the note) |
||
Line 2,331:
Object {stayWins: "202 20.2%", switchWins: "265 26.5%"}
</syntaxhighlight>
In the above code/problem version with n doors, only one "losing" door is opened/shown by the contestant before the possibility of switch. There is a generalization to the problem in which the contestant progressively opens losing doors one by one until two remains. In this case, the win probability of switching increases as the number of door increases. This has been discussed in a [https://www.researchgate.net/publication/262373808_A_generalization_of_the_Monty_Hall_Problem] 2009 article▼
Slight modification of the script above for modularity inside of HTML.
Line 2,386 ⟶ 2,388:
First Door Wins: 346 | 34.6%
Switching Door Wins: 654 | 65.4%</syntaxhighlight>
▲In the above code/problem version with n doors, only one "losing" door is opened/shown by the contestant before the possibility of switch. There is a generalization to the problem in which the contestant progressively opens losing doors one by one until two remains. In this case, the win probability of switching increases as the number of door increases. This has been discussed in a [https://www.researchgate.net/publication/262373808_A_generalization_of_the_Monty_Hall_Problem] 2009 article
===Basic Solution===
| |||