4.1 Intro to Discrete Probability | 4.1 Intro to Discrete Probability | Unit 4: Probability | Mathematics for Computer Science | Electrical Engineering and Computer Science

<Simplified Monty Hall Tree: Video
4.1.1Tree Model: Video
4.1.2Socks and Shoes
4.1.3Simplified Monty Hall Tree: Video
4.1.4Simplify Prize Tree
4.1.5Sample Spaces: Video
4.1.6Sum Rule Practice
4.1.7Addition Rule
4.1.8Fun With Coins
>Sample Spaces: Video

Simplify Prize Tree

Which of the following arguments simplifies the tree model for the Monty Hall SWITCH strategy?

The probability values of the outcomes are equal.

Branches after the prize location nodes are symmetric.

The tree branches are of the same size.

The door that conceals the prize and the door that the contestant picks can be condensed into whether the contestant picks the door with the prize.

If the door that conceals the prize is picked initially, the SWITCH strategy leads to losing, independent of which door is opened.

The branches that follow the two nodes where a door concealing a goat is picked, lead to the same outcome with the same probability, so these nodes could be combined.