Exhaustive Monty Hall Problems and Solutions

Volume 3, Issue 1, February 2018     |     PP. 57-66      |     PDF (346 K)    |     Pub. Date: January 14, 2018
DOI:    328 Downloads     7713 Views  

Author(s)

Xiwu Han, Queen’s University Belfast

Abstract
This paper at first isolates a group of Monty Hall problems, in which all doors are exhaustively chosen, swapped and revealed one by one, then introduces a new variant of briefer tree diagrams for the conditional probability calculation of three-doors and four-doors, and finally gives the recurrence form for n-doors and its closed generation function. Some resulted defusing advantages and interesting properties have also been discussed.

Keywords
Exhaustive; Monty Hall Problem; Probability Tree Diagram; Recurrence

Cite this paper
Xiwu Han, Exhaustive Monty Hall Problems and Solutions , SCIREA Journal of Mathematics. Volume 3, Issue 1, February 2018 | PP. 57-66.

References

[ 1 ] Carlton, Matthew (2005). "Pedigrees, Prizes, and Prisoners: The Misuse of Conditional Probability". Journal of Statistics Education [online] 13 (2).
[ 2 ] Mlodinow, Leonard (2008). The Drunkard's Walk – How Randomness Rules Our Lives, chapter 3 p. 53–56.
[ 3 ] Selvin, Steve (1975). "A problem in probability (letter to the editor)", American Statistician 29(1): p. 67.
[ 4 ] vos Savant, Marilyn (1990). "Ask Marilyn" column, Parade Magazine, p. 16.
[ 5 ] vos Savant, Marilyn (1991). "Ask Marilyn" column, Parade Magazine p. 12.