Doc Al said:
You most certainly are getting new information. Consider the case (discussed in the thread that you apparently haven't read!) where you have 1,000,001 doors. You pick at random. Your odds are pretty low (1/1,000,001) of being right. Now 999,999 doors are revealed to be empty. You'd have to be a bit slow not to realize that the odds are 1,000,000/1,000,001 that the prize is behind the one remaining door.
I'd like to work with this example to really drive the point home.
Scenario 1: There are 1,000,001 doors. Before the contestant does anything, the host proceeds to open 999,999 of the empty ones, leaving only two unopened doors behind for the contestant to choose from.
Scenario 2: There are 1,000,001 doors. The contestant chooses a door. The host proceeds to open 999,999 of the empty remaining ones, leaving the contestant the choice to remain with his original choice or to switch.
The claim is that in scenario 1, the contest has a 1/2 chance of choosing the door with the prize, whereas in scenario 2 he has a 1,000,000/1,000,001 chance of getting the prize if he chooses to switch.
Scenario 1 is uncontroversial; it is just a straightforward reduction of the problem to a simple random choice between two equally likely alternatives. So what has happened in scenario 2 to make it so radically different than scenario 1?
The key point is that in scenario 2, the contestant's initial guess at some random door reduces what is initially a probability space of 1,000,0001 equally likely choices into a drastically different probability space. Having chosen a particular door, and given the host's agreement to open all but one of the remaining doors such that all the opened doors are empty, the contestant is essentially given a
binary choice of whether to stay or switch, and so the problem space reduces into
two potential choices rather than 1,000,001. But these two potential choices are not equivalent, as in scenario 1. The one choice is to guess that the prize is behind the particular door that was initially picked; the other choice is essentially to guess that the prize is behind one of the 1,000,000 doors that was not picked. Obviously, the better bet is to choose the latter.
Yet another equivalent way to recast the problem is to once again eliminate the host, and simply give the contestant just one
negative guess. In this scenario, the contestant guesses that some particular door is
not the one with the prize, and if he guesses correctly, he wins the prize. Obviously, in the 3 door case, the contestant has a 2/3 chance of guessing that a certain door does
not have the prize, and in the 1,000,001 door case, he has a 1,000,000 / 1,000,001 chance of guessing correctly. But this process of negative guessing is exactly equivalent to what the contestant does in the traditional formulation where he picks a certain door and then switches after the host opens all but one of the remaining doors.