Page 2 of 2
Just three doors
Now try the original MH(3,2) problem.
The reasoning is exactly the same as in the MH(100,98) case, but not quite as extreme.
The player picks a door which has a 1/3 chance of having a car behind it.
This means that the car has a 2/3 chance of being behind the doors that the host has control of. After the host opens the door to reveal a goat the car still has a 2/3 chance of being behind the unopen door  again you would be an idiot not to swap.
Easy really!
And it is all because the car has more chance of being behind one of the doors that hasn't been picked!
The general case
You can even generalize to MH(n,m).
When the player picks a single door there are n1 left and so the probability of picking the wining door is just 1/n and the probability of the car being behind a door in the unpicked set is (n1)/n or (11/n).
If the host now opens m doors to show m goats the probability that the car is behind the remaining nm1 doors is still (11/n) and hence the chance that is behind any one door is (11/n)/(nm1).
As long as
(11/n)/(nm1) > 1/n
then the player should switch.
For example in the case of MH(3,1) we have
(11/3)/(311)=2/3>1/3
so you should switch. In the case of MH(100,98)
(11/100)/(100981) > 1/100
and again you should switch.
If you work this out for a few other examples, you should be able to see that only if the host opens even one door the player should switch because the probability that the car is behind one of the other doors is still better than the initial choice offered.
Other examples
What is interesting is that this situation occurs in other situations and you need to keep watch for it.
For example, you get exactly the same set of conditions with the threeshell trick. Here you place a pea under a shell, let the player pick a shell at random, reveal that the pea isn't under one of the other two shells, should the player switch? Of course, this is just MH(3,2).
There are card games where the banker has a knowledge of the hand and can remove cards that are clearly nonwinning and show the players  the same mechanism applies.
Whenever you make a random choice of some state and leave a larger set of possible states, then it is always better to rechoose if another mechanism whittles down the number of possible states after the choice.
The reason is that it is more likely that your first choice failed, and that what you are looking for is in the set of states that has now been reduced. So the probability of your new guess being correct is always geater than the probablity of your original guess.
The Red Programming Language 28/03/2017
There is a new version of the Red programming language available now. What? You have never heard of Red?

TypeScript 2.2 Adds More Code Actions 27/02/2017
There's a new release of TypeScript with more code actions, a new object type, and easier string indexing behavior among its improvements. TypeScript is a typed superset of JavaScript that compiles to [ ... ]
 More News 
