Not entertained, I have to say.
I find discussion of biassed Monty to be pointless. If he is allowing his knowledge of whether or not the correct door was selected first time to influence what he does next, it stops being a solvable puzzle and becomes an exercise in second-guessing.
I like the formulation of the discussion to focus on Monty's choice whether to offer the switch or not, rather than randomness in picking doors.
Rolfe.
I would not listen to Sol. He is bitter because he gets beaten.
All variants are all soluble.
If you think they are not, then you should accept that solutions based on multiple iterations cannot force an exact solution, and are largely irrelevant.
You mentioned Monty's motive, but that is again only ( perhaps) a consideration in the case of multiple iterations. The question does not concern that, but only should the contestant swap or not, using the given information.
The problem is generally presented like this:
A car is equally likely to be behind any one of three doors. You select one of the three doors (say, Door #1). The host then reveals one non-selected door (say, Door #3) which does not contain the car. At this point, you choose whether to stick with your original choice (i.e. Door #1), or switch to the remaining door (i.e. Door #2). What are the probabilities that you will win the car if you stick versus if you switch?
The usual solution is that there is an initial 1/3 chance that the contestant has picked the car. The goat is revealed, so the probability that the car is in remaining door is 2/3. (Why would you find that argument more convincing if there were 100 doors?)
Then there is this "accidental version"
In this variant, once you have selected one of the three doors, the host slips on a banana peel and accidentally pushes open another door, which just
happens not to contain the car. Now what are the probabilities that you will win the car if you stick with your original selection, versus if you switch to the remaining door?
No. It does not matter to the contestant
how he learns that the car is not there.
But, it is possible to consider that case.
Suppose you select Door 1, and the host accidentally opens Door 3. The probabilities that Door 3 happens
not to contain a car, if the car is behind Door 1, 2, 3, are respectively 1, 1, 0.
The general probabilities for the contestant (car is actually behind the door) are 1/2, 1/2, and 0.
Now there is no advantage in swapping. That is contrary solution that says that method is wrong.