Proving a probability paradox – Part 3
The last installation of the three part look at the Monty Hall problem
Last but not least, this third part of the our problem solving exercise delves into the code for the TextBox object. Part 1 and Part 2 can be found at their respective links. Part 1 contains the code we're analysing.
Proving a probability paradox – Part 2
This one's about the code.
Today we continue with the discussion regarding the Monty Hall Paradox. Part 1 of this guide can be found here. For those who want more insight into the Monty Hall problem, there's a good explanation on Wikipedia.
Programming is a great tool for solving problems, especially those which involve mathematics. As mentioned previously, the programming language I've chosen is C#. You could also replicate the simulation on several other languages.
Note: This is not a programming tutorial. If you want to learn C#, there are many guides on the Internet. This write-up will only briefly cover the C# language. The following describes how the software itself functions. That being said, mucking around with the code will help you learn how to work with the language.
Proving a probability paradox
Logic isn't always as obvious as one first thinks...
A paradox, by definition, is a contradiction of logic. I was recently introduced to the Monty Hall paradox, a probability driven problem which appears to have an obvious answer, but in reality, is quite sneaky.
The Monty Hall problem originated with the TV show 'Let's Make a Deal', in 1963. It's named after the host Monty Hall, and the problem in it's basic form involved three doors, each with an unknown object behind it. Only one of the doors contains a prize, the other two have an unwanted results - a goat.