Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T20:57:27.248Z Has data issue: false hasContentIssue false

Optimal strategies for the progressive Monty Hall problem

Published online by Cambridge University Press:  01 August 2016

Stephen K. Lucas
Affiliation:
Department of Mathematics and Statistics, James Madison University, Harrisonburg, VA 22807, USA e-mails: lucassk@jmu.edu; rosenhjd@jmu.edu
Jason Rosenhouse
Affiliation:
Department of Mathematics and Statistics, James Madison University, Harrisonburg, VA 22807, USA e-mails: lucassk@jmu.edu; rosenhjd@jmu.edu
Get access

Extract

In the classical Monty Hall problem you are a contestant on a game show confronted with three identical doors. One of them conceals a car while the other two conceal goats. You choose a door, but do not open it. The host, Monty Hall, now opens one of the other two doors, careful always to choose one he knows to conceal a goat. You are then given the options either of sticking with your original door, or switching to the other unopened door. What should you do to maximise your chances of winning the car?

Information

Type
Articles
Copyright
Copyright © The Mathematical Association 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable