Skip to content

Monty Hall problem

A worked three-door puzzle in which switching wins ⅔ of the time because the host's reveal was constrained by what he knew — drilling the move of updating on the protocol that produced an observation, not on its bare surface.

Core Idea

The Monty Hall problem is a probability puzzle: a contestant picks one of three doors (one prize, two goats), and a host who knows the layout and always reveals a goat opens one of the other two. Counter-intuitively, switching to the remaining closed door wins ⅔ of the time, staying only ⅓. The mechanism is informational — the host's choice is constrained by his knowledge, so the reveal is an act whose options depended on hidden state, and Bayesian updating concentrates the posterior on the switch door.

Scope of Application

A worked exemplar, not a field-deployed mechanism, so its genuine habitats are the teaching and reasoning-science contexts that use the identical three-door scenario.

  • Probability and statistics pedagogy — the home turf: the canonical worked example for conditional probability and Bayes' theorem, with named variants (n doors, Monty Fall).
  • Cognitive psychology of reasoning — a standard demonstration of how weakly intuition conditions on the data-generating protocol.
  • Decision-theory and Bayesian-inference teaching — the stock illustration that optimal choice depends on the generating protocol, not the data alone.
  • Analysis-as-craft shorthand — "this is a Monty Hall situation," labelling an observation whose generating process carries information.

Clarity

The puzzle makes one reasoning failure unmistakable: treating an observation as if generated unconditionally when a protocol — the host's constrained choice — produced it. It sharpens the distinction between the data and the data-generating process, showing that "a goat is behind door 2" carries entirely different weight depending on the policy that exposed it.

Manages Complexity

A heterogeneous family of conditional-probability traps — informative censoring, the prosecutor's fallacy, selection on the dependent variable, survivorship inference — shares one hidden structure and otherwise demands its own derivation each time. The puzzle compresses them into a single memorable case, so the analyst recognizes the structure by resemblance to one stored exemplar and reduces the whole family to one binary: was the observation selected by a process whose choices depended on the answer?

Abstract Reasoning

The exemplar drills conditioning on the protocol rather than the data, and a controlled-variation diagnostic: hold the door count fixed, vary only the host's policy, and watch the posterior swing from ⅔ to ½ — proving the information lives in the protocol. From that contrast it distills one boundary-drawing question for any inference, plus a reflexive prediction that showing the calculation will not dissolve the resistance; making the host's constraint vivid will.

Knowledge Transfer

Not an operative mechanism but a worked exemplar, so what transfers is a teaching device. Within probability and reasoning-science pedagogy that transfer is substantive — the same scenario, vocabulary and all, carries across conditional-probability, cognition, and decision-theory curricula. Into applied inference the structural lesson rides on the parent prime it instantiates, protocol-aware Bayesian updating (with selection bias as close kin); the goats and doors have no referent in a clinical trial, so the name travels only as analogy.

Relationships to Other Abstractions

Local relationship map for Monty Hall problemParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Monty Hall problemDOMAINPrime abstraction: Bayesian Updating — is a decomposition ofBayesianUpdatingPRIME

Current abstraction Monty Hall problem Domain-specific

Parents (1) — more general patterns this builds on

  • Monty Hall problem is a decomposition of Bayesian Updating Prime

    The Monty Hall puzzle is a worked instance of Bayesian updating in which the likelihood is determined by the host's state-dependent reveal protocol.

Hierarchy paths (5) — routes to 3 parentless roots

Neighborhood in Abstraction Space

Monty Hall problem sits in a crowded region of the domain-specific corpus (35th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Choice Paradoxes & Collective Decision-Making (14 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-07-12