Generalized Monty Hall Problem(100,000 Games) 100 Theoretical for Staying(1/n)--. Theoretical for Switching(n-1Vn 50 Number of doors References Don98 Dennis Donovan. The Www Tackles The Monty Hall Problem, 1998 http://math.rice.edu/ddonovan/montyurl.html. LR94 Thomas H. Cormen, Charles E Leiserson, and Ronald L. Rivest. Introduction to Algo- rithms. The MIT Press, Cambridge, Massachusetts, 19940 20 40 60 80 100 10 20 30 40 50 60 70 80 90 100 Percentage Won ￾ Number of Doors Generalized Monty Hall Problem (100,000 Games) Staying Switching Theoretical for Staying (1/n) Theoretical for Switching (n-1)/n References [Don98] Dennis Donovan. The WWW Tackles The Monty Hall Problem, 1998. http://math.rice.edu/˜ddonovan/montyurl.html. [LR94] Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algo￾rithms. The MIT Press, Cambridge, Massachusetts, 1994. 4