Anonymous user
Talk:Monty Hall problem: Difference between revisions
→Number of iterations: Some people need to go back to school or start thinking for themselves...
(→Number of iterations: Some people need to go back to school or start thinking for themselves...) |
|||
Line 103:
:::Your "show-goat" only depends on "round" (the state of which door has the car and which ones have the goat). In the actual Monty Hall problem, which goat the host shows also depends on the choice that the player makes (i.e. "initial" in your code) -- in particular, you need to make sure that the goat that the host shows is ''not'' the door that the player chose (i.e. "goat" should never be equal to "initial"). --[[User:Spoon!|Spoon!]] 07:36, 6 August 2009 (UTC)
:::Also, when the player chooses the winning door, preferably the goat door shown should be chosen randomly from the two available. If you always choose the one the has lower index then the player can use the ordering of the doors to get more information. --[[User:Spoon!|Spoon!]] 07:53, 6 August 2009 (UTC)
:If you look at the Tcl solution, you'll see that the chance depends massively on the strategy being used. (I'm rather proud of the fact that I separated the player strategies so it was clearer what was going on.) Indeed, this whole game is great for sorting out the men from the boys when it comes to probabilistic analysis. If it makes you feel easier, think of it this way: would you rather choose one or two doors to start out with? Does the prize move around? —[[User:Dkf|Donal Fellows]] 08:07, 6 August 2009 (UTC)
| |||