Monty Hall problem explained visually
blog.vctr.me
blog.vctr.me
You're allowed to pick one door, out of a million. Then, the host opens 999,998 of the other doors which he knows have a goat. This leaves the closed door you picked and one remaining closed door.
So, there's now two possibilities. Out of one million doors you somehow just happened to have guessed right and picked the right one. Or, you're wrong. If you're wrong then the correct door would be the other closed one.
This is, indeed, the most effective way to explain it, imo.
Without that information, the interlocutor naturally assumes that the offeror opens doors randomly - in which case the fact that he knows what's behind each door is an irrelevant "red herring" and the correct conclusion is different.
In the random-opening case the intuitive conclusion is right - that the agent (offeree)'s decision does not affect the odds. But if the question-poser revealed that the offeror is trying to maneuver the offeree into the result that's less valuable for the offeree, then the supposed mystery of the whole thing evaporates and the correct conclsion is obvious.
Of course it matters.
The host uses his knowledge to AVOID opening the door with the car (and thus ending the game prematurely).
So he essentially gives out this information: "the door with the car is one that I, the host, haven't opened".
At that point the host says "Ok, I'm going to open one of the other doors at random and then give you the chance to change your choice".
At this point 2 things could happen. Either he opens the door with the car in which case you will definitely switch to that door and have a 100% chance of winning.
Or he opens the door with a goat. There is a 1/3 chance that you picked correctly in the first place, therefore there is a 2/3 chance that you picked wrongly, so it's safer to assume that you picked wrongly.
You know that he didn't show you the car, so either you picked correctly to being with (1/3) or you picked wrongly (2/3), but if you picked wrongly then it must be behind the door that the host did not open. So you still have better odds from switching even though the host did not know.
There are 4 outcomes to the selection phase of this game:
1/3 - both pick goats
1/3 - you pick the goat, host picks the car
1/3 - you pick the car, host picks the goat
0 - you pick the car, host picks the car
So given the host picks a goat, switching or staying doesn't matter it's 50/50.
EDIT: An aside - why we shouldn't trust our intuitions, but instead actually work out these problems.
You are discussing some other game show.
The host is not opening just one door.
Example - there are 100 doors, you pick 1 that has the grand prize. There's a 1% chance you picked the prize on your selection. Monty Hall eliminates 98 of the doors, meaning there are 2 left. There's STILL a 1% chance you picked the door with the prize, but that means there's a 99% chance the only remaining door has the prize. Obviously, you should switch.
EDIT: I've also demo'd this using 3 cards (an ace and two others), but I like the idea of demonstrating with a larger scope. Call the ace of spades the prize, let the player select one card from the deck at random. Now they can keep that card or scour the remaining 51 cards for the ace of spades. A good tactile demonstration that they have a 1/52 chance (~2%) of having selected correctly the first time versus ~98% that they were wrong.
I think what confuses people is that they think a random door is revealed, whereas the problem says a goat is specifically chosen before the offer to switch.
Something like this was useful when I was first learning about the Monty Hall problem.
While still in college, I had a part-time job testing a spreadsheet product (back in the days when there were other commercial choices). One of the things we testers did to keep ourselves entertained was that we each picked a casino game, and implemented that game in spreadsheet macros. My game was blackjack, but another guy did craps.
Just for kicks, the guy who built the craps game re-wired it as an autoplay simulation, and left it playing against itself overnight. When we came back in in the morning, we found that the virtual player was rich, which seemed odd. So the next night we left it running again, and again the following morning, the player had made a bundle.
It turns out that my coworker had accidentally discovered a bug in the random number generator: the distribution of the results was a bit non-uniform.
The problem as stated sometimes leaves out crucial information that affects the outcome.
Example:
Game show, 3 doors. Contestant chooses one door. The host opens another door, which has a goat. Do you switch?
In this situation, it is not explained whether the host randomly picked one of the two remaining doors to open, without knowledge that one of them would contain a goat. This is the key missing information. If the host ALWAYS reveals the goat, then it is beneficial to switch as 2 out of 3 times the contestant wins by switching.
However, if the host is simply opening another door at random, and the door happens to contain a goat, then there is no advantage to switching, as the odds are 50/50.
edit: it appears that from the original version of the problem stated in Parade magazine, the implication is that the host knowingly reveals a goat.
"Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice?"
Contestant picks a door out of three. 1/3rd chance he's got the car. Then he is given the choice to either stick with his door, or do a coin-toss where you have to pick heads.
In this case, it seems obvious that option for the coin-toss is the better option, because it gives you a 50% chance of winning.
The confusing part of the problem is that you feel like you're doing one thing, where really it's two independent games where one clearly offers a bigger chance of winning.
That said, some people here have mentioned that it's not actually a 50% chance if you switch doors. So maybe my explanation is incorrect? And if it's incorrect, is it still correct enough to show that switching doors (i.e. opting for the coin-toss) is the better option?
First step: you are choosing one option from all available choices. Second step: you are now betting whether your original choice was the correct one.
By consciously narrowing down all the remaining options to one, the host is essentially asking you: "Do you think you guessed right?" As long as there are more than two available options at the start, the odds are greater than you guessed wrong.
As others have said, the important dynamic here is that the host _knows_ where the prize is and proceeds to open all the other doors, leaving only yours and one remaining closed. That remaining door then symbolizes an aggregate of all the doors you didn't select.
I'm quite convinced that it is different if the host knows versus if he does not, but I've never quite been able to put my finger on why in an intuitive way.
EDIT: Leaving my wrong answer, but bvk is correct.
My stab at it: If he doesn't know, then he's essentially another contestant, and his odds are the same 1 in 3 as yours. You've made selections one after the other, but since your selection has yet to be revealed as either right or wrong, you are essentially just picking different options from the same scenario. There are exactly equal chances that you won the car, he flubs and reveals the car, or he reveals a goat.
The way I explain is to expand it but also change the frame of reference to so its clear that the host is an adversary. Imagine we play a game called "who has the Ace of Diamonds"? I deal you one card face down and I deal me 51 cards. I look at my cards and then choose 50 of them to show you, none of which are the Ace of Diamonds. Do you want to keep your card or take the one I have not turned over?
Now imagine the same set up, but instead, after dealing the cards, I don't look at them. I then proceed to turn 50 of mine over one after the other and, though unlikely, I happen to not reveal the Ace of Diamonds. Now, is it any more likely the last card I haven't turned over yet is the card, than it is that you have it?
The game is no different in this case to one person lining up all 52 cards and turning them over one by one along the line. If you get to 50 cards and you still haven't found it, that obviously doesn't mean it's more likely to be the end card than the penultimate one.
But if you guess wrong, there's a 50% chance that the host reveals a car by accident.
So the probablities look like:
33%: you guess right, the host reveals a goat 33%: you guess wrong, the host reveals a goat 33%: you guess wrong, the host reveals a car
So, of the situations where the host reveals a goat, the car will be behind your door 50% of the time.
If the host knows and avoids the goat, the probabilities look like this:
33% you were right; the host reveals a goat 33% you were wrong; the host reveals a goat behind door B 33% you were wrong; the host reveals a goat behind door C
So in the situations where the host knows about and avoids the goat, 66% of them have the car behind the other door.
In the case where the host doesn't know about the car, picking the car on your first choice makes it more likely for the host to reveal a goat. That's the difference.
Are there other problems like the Monty Hall problem, perhaps in other disciplines?
http://consc.net/papers/envelope.html
And another that I've figured out the "right" answer to but think there might be more to it is this:
Suppose I set up a two-player game as follows:
1. One player is the "odd" player, the other is
the "even" player.
2. Each player may choose a single number per turn,
either one or two.
3. The result of each turn is the sum of the two players'
choices. For example, if the even player picks 1 and the
odd player picks 2, the result of that turn is 3.
4. If the result is odd, the even player pays the odd
player that amount, and vice-versa. In our example
result of 3, the even player would pay the odd player 3
dollars.
Question: Is this game fair? If not, is it possible to give either player a per-turn stipend to make the game fair? If so, how much is that amount?I guess that the odd player can always choose 1. In that case he can either win 3 or lose 2. Making that the favorable choice for the odd player.
Even player could always choose 2 in which case he can either win 4 or lose 3. Making this the favorable choice for the even player. However, if both players play their favorable choice, odd player always wins: 2 + 1 = 3.
I'm not sure if I got this right, but that's my thinking so far...
Flip a coin. If it is heads, flip again and answer Yes for heads and No for tails. If the first coin is tails, answer the question: "Have you ever cheated on your spouse?"
Now, what is the probability the person is a cheater given they answered yes?
I'll label the four outcomes 1Y, 1N, 2Y, 2N. Let X = probability person cheated on spouse.
If I flip heads first, I get yes or no equally. So the first two outcomes are: 1Y(50%) or 1N (50%).
If I flip tails, I answer 2Y (X) or 2N (1-X).
So the distinct pdf is: 1Y (25%) 1N (25%) 2Y (0.5X) 2N (1-0.5X)
And combined, Y = 0.25+0.5X
What am I missing? (Wait, oh, is this a stupid joke about whether they lied about cheating on their spouse? Dammit.)
Anyway, here is the code below: http://jsfiddle.net/nQ3Gu/
var runs = 1000,
honest_admissions = 0,
automatic_admissions = 0;
function flip() {
return Math.random() < 0.5 ? 'h' : 't';
}
for (var i = 0; i < runs; i++) {
if (flip() == 't') {
honest_admissions++;
} else if (flip() == 'h') {
automatic_admissions++;
}
}
document.write('The "yes" is honest ' + honest_admissions / (honest_admissions + automatic_admissions) + ' of the time.')
2/3 of yeses are honest and 1/3 didn't have to answer the question!I think this is indeterminate. You have to know the ratio of total yesses to total participants.
The real world use-case I was recalling is simpler: flip a coin and answer honestly if it's heads and "yes" if it's tails. Any individual response is non-incriminating, but if N is large enough where you can assume N/2 got heads, you can know the number of "honest cheaters."
In the classical problem with 3 doors, if you pick a door with a car, the host will only open 1 other door.
In your demo, if I use 40 doors and pick one, the host opens all other doors but one. Why?
If the one of those 40 I pick has a car, will the host open all remaining doors? That doesn't seem to be the case for the 3-door variant.
Let's analyze the classical problem. After you pick a door, one of the remaining two doors is opened.
With more doors (say, 11), it wouldn't make for an interesting show if you opened 9 more doors after the first one. A more reasonable approach would be to open one additional door and let the player choose to switch or stay with their choice each time. But that would only complicate the explanation, of course.
Let's dissect the 11-door case. We will do the following: the player picks a door, then the host a) opens one other door; b) opens 50% of the remaining doors; c) leaves one door closed.
IMO, the (a) case is the closest generalization of the original problem. You have a 1/11 chance to pick the car door on your first try. Then, one other door is opened, and if you switch to another random door, the best case probability of you getting the car is 10/11 * 1/9 = 10/99. This number is slightly bigger than 1/11.
In the (b) case you get a better result when switching, but to me that just looks like adding artificial bias. Obviously, the (c) case looks best because you've removed so much choice by leaving only one other door closed. Adding more doors does one thing: improves the probability of switching. That's good if this is what you're aiming for. But this turns it into a completely different problem.
So, you can see that the result depends on what you want to get. If you try to stay faithful to the original problem statement, adding more doors actually makes the benefit of switching less obvious.
In summary, I'm convinced that 3 is not an accidental number in the original problem statement. Whoever came up with it, they knew how to remove space for speculation by providing the only reasonable thing to do: open 1 door (or 50% of the doors) and leave 1 other door closed.
(a) demonstrates that the questioners intuition about the probabilities is off, but (again, IMO) doesn't really offer the clarity of (c).
Re: Summary - I agree, it's not an accident. It was chosen because it was a good number for a game show, and leaving the participant with 2 options (switch or stay) ensures a certain swiftness of decision. While (a) (say they used 4 or 5 doors) offers only a slight improvement on the odds (contestants may lose too often) and (c) (again with 4 or 5 doors) offers a perhaps too great improvement of the odds (contestants win too much if they know the trick).
Alright, good guess, but would you consider changing? You can either keep your original guess, or switch to this one other star I'm pointing to now.
Everyone switches.
Watching this play out really kills any remaining gut response that would say "it's the same either way!"
"Our table has spam, spam, spam, spam, eggs, spam, spam, and spam. You've chosen your dish, now let's see what else was on the table...."
;)
(per above post At least this made it to stats intro class)
Except for this "problem" which people will still be arguing about.
Play 50 games every time you see him until he gets it.