Re:Probabilistic Programming and Bayesian Methods for Hacker...
by meuk on Wednesday February 28, 2018 @01:31PM
(#16485384)
It's fairly obvious to me (after careful elaboration, that is): if you don't switch, you'll win iff you got the right door the first time (1/3). If you do switch you'll win iff you picked one of the wrong doors (2/3).
[ Parent
| on HN ]
Re:Probabilistic Programming and Bayesian Methods for Hacker...
by carlmr on Wednesday February 28, 2018 @03:01PM
(#16486252)
My intuitive explanation when I was tutoring statistics was the following. (This works better while drawing I find.)
Assume you pick one door. It's the right door with a chance (1/3) and the wrong door with a chance (2/3).
Now if you could pick both other doors (2/3) you would choose those. And this is exactly what you're doing when you switch after the reveal.
The other two doors always have one wrong one, which can be revealed. So switching after the reveal is the same as having the chance to pick two doors before the reveal.