{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Problem\n\nA game show has three closed doors. A car is behind one door, chosen uniformly at random, and a goat is behind each of the two other doors.\nThe player chooses one door. Then the host, who knows where the car is, opens one of the two other doors and shows a goat.\nIf both other doors hide goats, the host chooses one of them with probability $1/2$ each. The host always opens a door and always offers a switch.\nThe player can keep the first door or switch to the other closed door. Which choice gives the larger probability of the car?\n\n## Remarks\n\nUnder these assumptions, switching wins with probability $2/3$ and staying wins with probability $1/3$. The player's first door hides the car with probability $1/3$, and the host's action does not change this.\nThe conditional probability that switching wins, given the door that the host opens, is also $2/3$. [[Bayes' theorem|0NM6E9VW04]] gives this.\nThe answer depends on the rules of the host. If the host opens a random other door and it shows a goat by chance, both choices win with probability $1/2$.\n\n## History\n\nSteve Selvin posed the problem in a letter to The American Statistician in 1975. It became famous through the column of Marilyn vos Savant in Parade magazine.\n\n## Explanations\n\n### L1 human\n\nStaying wins only when your first choice was right, which happens one time in three.\nSwitching wins every time your first choice was wrong, which happens two times in three.\n",
  "commit": "f591989ed15704e9d8755a7a5a6426d73de7a3ae",
  "front": {
    "kind": "problem",
    "msc": [
      "60C05"
    ],
    "name": "Monty Hall problem",
    "same_as": {
      "wikidata": "Q198835",
      "wikipedia": "Monty Hall problem"
    },
    "sources": [
      {
        "locator": "Standard assumptions",
        "url": "https://en.wikipedia.org/wiki/Monty_Hall_problem"
      }
    ],
    "tag": "0PBWWQD9KY",
    "uses": [
      "0FJB06AD2P",
      "0NM6E9VW04"
    ]
  },
  "kind": "problem",
  "link": "https://math2.tamnd.com/node/0PBWWQD9KY/",
  "links": [
    {
      "field": "uses",
      "target": "0FJB06AD2P"
    },
    {
      "field": "uses",
      "target": "0NM6E9VW04"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0PBWWQD9KY.md",
  "msc": [
    "60C05"
  ],
  "name": "Monty Hall problem",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0PB/0PBWWQD9KY.md",
  "status": null,
  "tag": "0PBWWQD9KY",
  "uri": "m2://0PBWWQD9KY",
  "url": "https://math2.tamnd.com/wiki/monty-hall-problem/",
  "writing": {
    "tag": "0PBWWQD9KY",
    "kind": "problem",
    "level": "W1",
    "next": [
      {
        "what": "edge bounds both",
        "have": 0,
        "want": 1
      }
    ]
  }
}