The Problem with Monty Hall

Contestant’s initial choice Prize door Don’t switch Switch 
Win Lose 
Lose Win 
Lose Win 
Lose Win 
Win Lose 
Lose Win 
Lose Win 
Lose Win 
Win Lose 
  3 Wins 6 Wins 

7 comments

  1. I would present a new argument:
    Time is not factored in with your results. The fact that he will always opens a wrong door makes it so there are not three choices but two. Even if you have three at the start, one wrong one will be removed so really its only ever 50%, no matter what you do at any point.

    Like

  2. I think the biggest problem with the Monty Hall-problem is that the initial question excludes some important information. The way it is stated, it seems like it´s up the host whether or not he will open a door. Likewise the contestant doesn´t know that the host has to open the door. If the rule: “the host has to open a door with a goat” was clearly stated from the beginning there would be much less confusion about the Monty Hall-problem.

    Like

  3. The table which sets out ‘all the cases’ in the article leaves out some cases. The first ‘case’ in the table is really two cases: Case 1. Contestant picks Door 1. Prize in Door 1. Monty opens 2. Case 2. Contestant picks Door 1. Prize in 1. Monty opens 3. That makes two wins from not switching doors. The table in the article ignores what Monty Hall does- yet the problem specifically is about what to do after Monty Hall opens a particular door. There are six winning cases from not switching and six winning cases from switching.

    Like

  4. I honestly think it is crazy to think of the game in anything other than 2 stages. First stage has equal probability between 3 choices: 3 doors, and only one of them has a car.

    Stage two is that you have 2 doors, and only one of them has a car.

    It is irrelevant that you’ve “chosen” one of the doors already, since you have the ability to switch.

    If anyone were to seriously study this problem, and performed it over a long period of time, they’d realize it has nothing to do with math, and everything to do with whether or not the host tries to dupe you out of a right choice! And what is the probability that he will try to con you out of a right choice? Who the heck knows, you can’t put that in an equation. To me the position of vos Savan is a little naive.

    Like

  5. Hi, I think the solution to the Monte Hall problem is wrong, but I am certainly not the first nor smartest person to say that. I believe your matrix above is incorrect in that it has only 9 outcomes instead of 12. Each case where the contestant guesses correctly generates two cases, one for each door that Monte opens. That is, if the prize in in door 1, and I guess door one, Monte opens door 2, and the case where I guess door 1 and Monte opens door 3 are two different cases. In both of those cases I lose by switching. Adding those missing cases in results in 50/50.

    Like

  6. I think where people struggle to accept that it isn’t 50/50 is in the explanation of why it’s better to switch. Odds are 2/3 it’s behind one of the other 2 doors, and since one is opened to reveal a goat, it’s 2/3 odds it’s behind the other door. Here’s the problem with that explanation: odds are 2/3 it’s behind any combination of 2 doors, including the picked door and another door. If A is picked, there’s a 2/3 chance of it being behind B or C. If A is picked, there’s also a 2/3 chance of it being behind A or C. For all the cases where it is behind B or C, if C is opened, it must be behind B. For all the cases where it is behind A or C, if C is opened it must be behind A. Here’s where the host constraints affect the odds. The host cannot open the picked door; the host cannot open the car door. There’s only 1 case where it is behind the picked door (A) or an unpicked door (C), AND the unpicked door (C) can be opened. However there are 2 cases where it is behind an unpicked door (B or C), AND an unpicked door (C or B) can opened. That’s why it’s twice as likely to be behind the unopened door (2/3 vs 1/3) and it is to your advantage to switch. Unless you prefer to have a goat.

    Like

  7. “So why do so many people get this problem wrong?”

    Description is too concise. Anyway mathematicans will never accept that. Although it works well in simulation but can not express with equations.

    0, Preparation steps …

    1, Contestant says a number.

    2, Host forms groups.

    3, Host assigns the number the contestant’s group.

    4, Host assigns two remain doors to itself.

    5, Host removes a loser door from its own group.

    6, Host asks.

    Like

Leave a comment