Problem 700. Monty Hall

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?><w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The classic Monty Hall \"Let's Make a Deal\" final showcase puzzle pits the contestant against three Doors. Behind one Door are dream prizes and behind the other two are Donkeys and Chickens.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>The contestant picks a Door: 1 2 or 3.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Monty then reveals a Door that is Not the winner.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>As the contestant do you stay with your original Door or swap to the other Door?</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Your routine will be called twice.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>The first time it will see [0 0 0]. You are to select a Door: return an Integer 1,2 or 3.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>The second time your function will see [1 2 0] or [1 0 2],if you had selected door number 1. The 2 denotes a revealed Losing Door.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>You may now choose Door 1 (no change) or switch to the available door denoted by the zero.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Return an Integer 1, 2, or 3</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Input [0 0 0]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Output 2</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Input [0 1 2] % Your first selection is denoted by 1. 2 is a losing Door</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Output 1 % This selects Door 1, swapping from Door 2</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>The Test engine will determine if your final selection is a Winner</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>The routine will run the game 100 times calling your function twice for every game.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Your Strategy \"Passes\" if it wins > 50% of the time.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>This is the first in a series of planned interactive Games.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>This example is also to demonstrate Cody multi-call interactivity capability.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Let's Make a Deal</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

The classic Monty Hall "Let's Make a Deal" final showcase puzzle pits the contestant against three Doors. Behind one Door are dream prizes and behind the other two are Donkeys and Chickens.The contestant picks a Door: 1 2 or 3.Monty then reveals a Door that is Not the winner.As the contestant do you stay with your original Door or swap to the other Door?Your routine will be called twice.The first time it will see [0 0 0]. You are to select a Door: return an Integer 1,2 or 3.The second time your function will see [1 2 0] or [1 0 2],if you had selected door number 1. The 2 denotes a revealed Losing Door.You may now choose Door 1 (no change) or switch to the available door denoted by the zero.Return an Integer 1, 2, or 3Example:Input [0 0 0]Output 2Input [0 1 2] % Your first selection is denoted by 1. 2 is a losing DoorOutput 1 % This selects Door 1, swapping from Door 2The Test engine will determine if your final selection is a WinnerThe routine will run the game 100 times calling your function twice for every game.Your Strategy "Passes" if it wins > 50% of the time.This is the first in a series of planned interactive Games.This example is also to demonstrate Cody multi-call interactivity capability.Let's Make a Deal

The classic Monty Hall "Let's Make a Deal" final showcase puzzle pits the contestant against three Doors. Behind one Door are dream prizes and behind the other two are Donkeys and Chickens.

The contestant picks a Door: 1 2 or 3.

Monty then reveals a Door that is Not the winner.

As the contestant do you stay with your original Door or swap to the other Door?

Your routine will be called twice.

The first time it will see [0 0 0]. You are to select a Door: return an Integer 1,2 or 3.

The second time your function will see [1 2 0] or [1 0 2],if you had selected door number 1. The 2 denotes a revealed Losing Door.

You may now choose Door 1 (no change) or switch to the available door denoted by the zero.

Return an Integer 1, 2, or 3

Example:

Input [0 0 0]

Output 2

Input [0 1 2] % Your first selection is denoted by 1. 2 is a losing Door

Output 1  % This selects Door 1, swapping from Door 2

The Test engine will determine if your final selection is a Winner

The routine will run the game 100 times calling your function twice for every game.

Your Strategy "Passes" if it wins > 50% of the time.

This is the first in a series of planned interactive Games.

This example is also to demonstrate Cody multi-call interactivity capability.

Let's Make a Deal

Solve

Solution Stats

150 Solutions
38 Solvers

Last Solution submitted on Apr 15, 2023

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers38

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 700. Monty Hall

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers38

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Problem 700. Monty Hall

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers38

Suggested Problems

More from this Author260

Problem Tags

Community Treasure Hunt

Players