AI engineering glossary · Probability

What is Monty Hall problem?

Monty Hall problem: A famous puzzle in conditional probability: after a contestant picks one of three doors and the host opens another door that has no prize, switching wins with probability 2/3 while staying wins with 1/3. It shows how new information changes probabilities.

Level: intermediateTopic: Probability

Monty Hall problem: an example

Simulating 10,000 games shows switching wins about 6,667 times and staying about 3,333.

Related terms

More Probability terms

Where you learn it

Monty Hall problem is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.

Before you go

Take the cheat sheet with you

One free PDF: the key AI-engineering terms, formulas and Python idioms. No spam; unsubscribe any time.