Anonymous user
Talk:Monty Hall problem: Difference between revisions
→Number of iterations
No edit summary |
|||
Line 101:
:Umm... that is the infamous fallacy of the Monty Hall problem. See [[wp:Monty Hall problem|Wikipedia: Monty Hall problem]]. The correct probability of winning by switching is 2/3, which is approximately 66.7%. This is the whole point of the problem and why it's so famous. --[[User:Spoon!|Spoon!]] 06:33, 6 August 2009 (UTC)
::Sorry for inserting misinformation. Could you please tell me why my program guesses correctly 50% of the time instead of 2/3 of the time? It's the Common Lisp one.
:::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)
| |||