International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
|
Volume 11 - Issue 9 |
Published: Jan 2017 |
Authors: Mazen Alrahili |
![]() |
Mazen Alrahili . Different Versions of the Monty Hall Problem. International Journal of Applied Information Systems. 11, 9 (Jan 2017), 12-17. DOI=10.5120/ijais2017451642
@article{ 10.5120/ijais2017451642, author = { Mazen Alrahili }, title = { Different Versions of the Monty Hall Problem }, journal = { International Journal of Applied Information Systems }, year = { 2017 }, volume = { 11 }, number = { 9 }, pages = { 12-17 }, doi = { 10.5120/ijais2017451642 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2017 %A Mazen Alrahili %T Different Versions of the Monty Hall Problem%T %J International Journal of Applied Information Systems %V 11 %N 9 %P 12-17 %R 10.5120/ijais2017451642 %I Foundation of Computer Science (FCS), NY, USA
The Monty Hall problem is a conditional probability example in which one of three doors has a big prize and other two doors conceive worthlessly. The game features are a rational decision between stay or switch given the constraints of the game. This paper aims to explain the different versions of the Monty Hall Problem in a many way to approve and solve the Monty Hall problem.