Monopoly is an amazing game of mathematics and economics. Its the perfect introduction for Markov Chains which deals with probabilities when your future states are independant of your past states, much like the random walk problems when studying brownian motion.
Using a simulator, you can compile the probability of each space on a monopoly board and the results can be found on this website for the US version.
http://www.tkcs-collins.com/truman/monopoly/monopoly.shtml
This brute force method of estimating the probabilities is called the Monte Carlo Method which you just roll 2 dices constantly and count how many times you hit each square and just compilte the stats that way.
A faster way is to use a computer. Here is an animation for the probabilities from the 1st turn to the 40th turn.
http://www.bewersdorff-online.de/amonopoly/
Just click to start the animation and you can see the probabilities generate.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment