How to resolve the algorithm Monty Hall problem step by step in the Rust programming language
How to resolve the algorithm Monty Hall problem step by step in the Rust 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 Rust programming language
Source code in the rust programming language
extern crate rand;
use rand::Rng;
use rand::seq::SliceRandom;
#[derive(Clone, Copy, PartialEq)]
enum Prize {Goat , Car}
const GAMES: usize = 3_000_000;
fn main() {
let mut switch_wins = 0;
let mut rng = rand::thread_rng();
for _ in 0..GAMES {
let mut doors = [Prize::Goat; 3];
*doors.choose_mut(&mut rng).unwrap() = Prize::Car;
// You only lose by switching if you pick the car the first time
if doors.choose(&mut rng).unwrap() != &Prize::Car {
switch_wins += 1;
}
}
println!("I played the game {total} times and won {wins} times ({percent}%).",
total = GAMES,
wins = switch_wins,
percent = switch_wins as f64 / GAMES as f64 * 100.0
);
}
You may also check:How to resolve the algorithm Loops/With multiple ranges step by step in the Vala programming language
You may also check:How to resolve the algorithm JSON step by step in the PowerShell programming language
You may also check:How to resolve the algorithm Canonicalize CIDR step by step in the Haskell programming language
You may also check:How to resolve the algorithm Average loop length step by step in the Julia programming language
You may also check:How to resolve the algorithm Terminal control/Coloured text step by step in the BaCon programming language