3 ms·

> The contestant chooses a door. If they choose right, they win. Otherwise the host effectively flips a coin and, with 50% probability, the game starts over. Ot

> The contestant chooses a door. If they choose right, they win. Otherwise the host effectively flips a coin and, with 50% probability, the game starts over. Otherwise the contestant loses. That isn't what happening in the first simulation. The game doesn't end if the contestant chooses the prize door initially. The contestant simply chooses a door. The host randomly chooses between the remaining doors. If they reveal the prize, the game is restarted. If they reveal an empty door, then the game is logged as either "the original door was correct" or "the remaining door was correct". This is the definition of "the host chooses randomly". > The host then peeks behind a door the door contestant didn’t choose (without showing anyone else what’s there) at random. If the prize isn’t there, the host reveals that there is no prize behind the door. Otherwise the host forgets they peeked and repeats the peek-and-choose step until they randomly get an empty door. Picking random doors until an empty one is found absolutely the same thing as randomly choosing amongst the available doors that don't contain a prize. You can implement any function you like here. Either the host always opens a door that does not contain the prize, or the host has a 1/3 chance of revealing the prize and the game is restarted. There is simply no other possibility.

amluto 5y ago
> Picking random doors until an empty one is found absolutely the same thing as randomly choosing amongst the available doors that don't contain a prize. You can implement any function you like here. Either the host always opens a door that does not contain the prize, or the host has a 1/3 chance of revealing the prize and the game is restarted. There is simply no other possibility. Not entirely. The issue is what, exactly, gets restarted. Version A: contestant chooses a door. Then the host picks a door and, if the host finds the prize, restarts the whole game if they picked the door with the prize. There is a 1/3 chance the contestant finds the prize. There is a 1/3 chance the contestant does not find the prize and and host does not find the prize. And there is a 1/3 chance neither one finds the prize. So 1/3 of the time the game restarts and, conditioned on a completer run, the contestant’s first guess was right with 50% probability. Version B: contestant chooses a door. Then the host picks a door and, if the host finds the prize, restarts just this step and picks another door. There is a 1/3 chance the contestant finds the prize. If this happens, the host won’t find the prize. If the contestant’s first guess was wrong, there is a 1/2 chance the host finds the prize on any given try, but the host keeps trying so the host will not find the prize when the loop is done. So, conditioned on a completed run, the contestant’s first guess is correct 1/3 of the time. See the difference?

amluto 5y ago

> Picking random doors until an empty one is found absolutely the same thing as randomly choosing amongst the available doors that don't contain a prize. You can implement any function you like here. Either the host always opens a door that does not contain the prize, or the host has a 1/3 chance of revealing the prize and the game is restarted. There is simply no other possibility. Not entirely. The issue is what, exactly, gets restarted. Version A: contestant chooses a door. Then the host picks a door and, if the host finds the prize, restarts the whole game if they picked the door with the prize. There is a 1/3 chance the contestant finds the prize. There is a 1/3 chance the contestant does not find the prize and and host does not find the prize. And there is a 1/3 chance neither one finds the prize. So 1/3 of the time the game restarts and, conditioned on a completer run, the contestant’s first guess was right with 50% probability. Version B: contestant chooses a door. Then the host picks a door and, if the host finds the prize, restarts just this step and picks another door. There is a 1/3 chance the contestant finds the prize. If this happens, the host won’t find the prize. If the contestant’s first guess was wrong, there is a 1/2 chance the host finds the prize on any given try, but the host keeps trying so the host will not find the prize when the loop is done. So, conditioned on a completed run, the contestant’s first guess is correct 1/3 of the time. See the difference?