How to resolve the algorithm Monty Hall problem step by step in the Arturo programming language
How to resolve the algorithm Monty Hall problem step by step in the Arturo programming language
Table of Contents
Problem Statement
Suppose you're on a game show and you're given the choice of three doors. Behind one door is a car; behind the others, goats. The car and the goats were placed randomly behind the doors before the show.
After you have chosen a door, the door remains closed for the time being. The game show host, Monty Hall, who knows what is behind the doors, now has to open one of the two remaining doors, and the door he opens must have a goat behind it. If both remaining doors have goats behind them, he chooses one randomly. After Monty Hall opens a door with a goat, he will ask you to decide whether you want to stay with your first choice or to switch to the last remaining door. Imagine that you chose Door 1 and the host opens Door 3, which has a goat. He then asks you "Do you want to switch to Door Number 2?"
Is it to your advantage to change your choice?
The player may initially choose any of the three doors (not just Door 1), that the host opens a different door revealing a goat (not necessarily Door 3), and that he gives the player a second choice between the two remaining unopened doors.
Run random simulations of the Monty Hall game. Show the effects of a strategy of the contestant always keeping his first guess so it can be contrasted with the strategy of the contestant always switching his guess. Simulate at least a thousand games using three doors for each strategy and show the results in such a way as to make it easy to compare the effects of each strategy.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Monty Hall problem step by step in the Arturo programming language
Source code in the arturo programming language
stay: 0
swit: 0
loop 1..1000 'i [
lst: shuffle new [1 0 0]
rand: random 0 2
user: lst\[rand]
remove 'lst rand
huh: 0
loop lst 'i [
if zero? i [
remove 'lst huh
break
]
huh: huh + 1
]
if user=1 -> stay: stay+1
if and? [0 < size lst] [1 = first lst] -> swit: swit+1
]
print ["Stay:" stay]
print ["Switch:" swit]
You may also check:How to resolve the algorithm Fibonacci n-step number sequences step by step in the Java programming language
You may also check:How to resolve the algorithm Guess the number step by step in the MAXScript programming language
You may also check:How to resolve the algorithm Arbitrary-precision integers (included) step by step in the TXR programming language
You may also check:How to resolve the algorithm Zero to the zero power step by step in the TI-83_BASIC programming language
You may also check:How to resolve the algorithm SHA-1 step by step in the UNIX Shell programming language