monty

Simulation of the Monty Hall Problem. 
This demonstrates that switching is always better than staying with 
the initial guess.
Programme written by Corey Chivers, 2012

Contains data sets, programmes and illustrations
discussed in the book, "Introduction to Probability, Statistics and R:
Foundations for Data-Based Sciences."  Sahu (2024, isbn:9783031378645)
describes the methods in detail.

Sujit K. Sahu

ipsRdbs

Introduction to Probability, Statistics and R for Data-Based
Sciences

monty function

<dl><dt>strat</dt>
<dd>Strategy to use; possibilities are:<ul>
<li>"stay": Do not change the initial door chosen.</li>
<li>"swap": Swap the door chosen initially.</li>
<li>"random": Randomly decide to stay or swap.</li>
</ul></dd>
<dt>N</dt>
<dd>How many games to play, defaults to 1000.</dd>
<dt>print_games</dt>
<dd>Logical; whether to print the results of each game.</dd></dl>

Arguments

Simulation of the Monty Hall Problem. 
This demonstrates that switching is always better than staying with 
the initial guess.
Programme written by Corey Chivers, 2012 — monty

<dl>

<dt>strat</dt>
<dd>Strategy to use; possibilities are:<ul>
<li>"stay": Do not change the initial door chosen.</li>
<li>"swap": Swap the door chosen initially.</li>
<li>"random": Randomly decide to stay or swap.</li>
</ul></dd>


<dt>N</dt>
<dd>How many games to play, defaults to 1000.</dd>


<dt>print_games</dt>
<dd>Logical; whether to print the results of each game.</dd>

</dl>

Simulation of the Monty Hall Problem. 
This demonstrates that switching is always better than staying with 
the initial guess.
Programme written by Corey Chivers, 2012

monty: Simulation of the Monty Hall Problem. This demonstrates that switching is always better than staying with the initial guess. Programme written by Corey Chivers, 2012

Description

Usage

Value

Arguments

Examples