|
|
#4
10-15-2005, 06:18 PM
|
|||
|
|||
Re: Monte hall problem
One way I've seen explained that makes LOTS of sense is this:
Pretend there are 100 curtains, one of which has "the prize" behind it(instead of the normal 3 curtains) You pick one, and Monty takes away 98 of the unpicked ones, showing no prize in them. Now, are you seriously considering keeping your original curtain? 
|
|
#6
10-15-2005, 11:18 PM
|
|||
|
|||
|
Re: Monte hall problem
My statistics professor explained this to me perfectly.
3 doors (1 car, 2 goats). Thus you have a 1 in 3 chance (33%) of picking the right door. A door is then revealed to you showing you 1 of the goats. So there are two doors remaining. YOU SHOULD ALWAYS SWITCH (assuming they will always show you a goat, because they always can). If you do not switch you have your 33% chance of picking correctly. If you switch: 33.3% of the time you have the car and switch to the goat. 66.6% of the time you have a goat and are switching to the car. Thus you have a 66% chance of winning the car if you switch. Some people had a hard time understanding this so he had a great example. He pulled out a deck of cards and said, you have to select the ace of spades, and a student selected 1 card (face down). He then took the remaining deck and began showing him cards, saying "Ok 4 of clubs" discarded it, etc etc etc Until there was 1 only card left in his "deck" So now there are two cards, the one the student picked and the one he has left (he has shown him 50 cards from the 51 remaining that aer NOT the ace of spades). He then asked the student, "Do you wanna switch" and of course the studen twas like "hell ya" The odds of him having the ace of spades were nto 50% even though only 2 cards remained.
|
|
#7
10-15-2005, 11:34 PM
|
|||
|
|||
|
Re: Monte hall problem
The way that I think it is best explained is by looking at all the possible outcomes.
Assume the prize is behind door 3 If you never switch the outcomes are: You pick door 1, the host shows you door 2, you stay with door 1. Outcome: lose You pick door 2, the host shows you door 1, you stay with door 2. Outcome: lose You pick door 3, the host shows you door 1 or 2, you stay with door 3. Outcome: win If you always switch the outcomes are: You pick door 1, the host shows you door 2, you switch to door 3. Outcome: win You pick door 2, the host shows you door 1, you switch to door 3. Outcome: win You pick door 3, the host shows you door 1 or 2, you switch to door 1 or 2. Outcome: lose. Therefore by not switching you win 1/3 times. By switiching you win 2/3.
|
|
#8
10-16-2005, 12:02 AM
|
|||
|
|||
|
Re: Monte hall problem
[ QUOTE ]
My statistics professor explained this to me perfectly. [/ QUOTE ] That may be, but you left out crucial assumptions about the problem. See the writeup in the archives of rec.puzzles, or past discussions in the archives of this forum.
|
|
#9
10-16-2005, 12:34 AM
|
|||
|
|||
|
Re: Monte hall problem
Yes I left them out because they would confuse the OP I assumed.
Read King Yao's book "Weighing the Odds in Hold'Em Poker" for a detailed explination of the assumptions. Basically, we are assuming that Monty Hall is not trying to trick us and that he was going to show us a goat no matter what we choose originally. If Monty Hall WANTS us to lose he may only show us a goat if we originally picked the car, in a tricky attempt to get us to switch. This scenario is more appllicable to an opponent in poker, but as it applies to the Monty Hall it is safe to assume that Monty Hall always shows a goat no matter what we picked, it makes for better tv drama, a better show, etc.
|
|
#10
10-16-2005, 12:44 AM
|
|||
|
|||
|
Re: Monte hall problem
The solution only works (from a pure math point of view) if Monte always shows you a non-car door and is always offers you the chance to switch. These are usually implicitely assumed in the problem. But ....
Some years ago, Monte himself commented and said that there were a lot of factors that went into whether he offered the switch, so in the real world, the Monte Hall problem never met the requisite conditions. If the conditions above aren't met, it becomes an interesting game theory problem, with certain unanswerable questions, such as what are Monte's motivations and how many cars does he want to give away in a week. Anyway, for anyone who doubts the solution and can't follow the math, try this. You be the contestant and get a friend to be Monte. Have your friend take two black cards and one red card. Mix them up (so you can't see) and determine where the red card is. Your friend will offer you the choice of cards,. You 'win' if you get the red card. Before you look, your friend turns over one black card and offers you the chance to switch to the other card that you didn't choose. Now -- for this experiment, either always accept the choice or always decline it. If you run the experiment enough times, you'll find one of the following: 1. If you always accept you win 2/3 of the time or 2. If you always decline you win 1/3 of the time.
|
 |
|
|
Linear Mode
