![]() Necessary to estimate the probability-for each square-that Probabilities exactly using the Markov matrix, it is In the process of figuring all of this out I ran into an Me to believe that these results are reliable. ![]() The Markov one and the results are very close, which leads I have compared the results from my simulation program and I computed probabilitiesįor both cases and have included them here. The board because the more time you spend in jail, the less Strategy changes the probabilities for all of the squares of Game, it is best to stay in jail as long as possible toĪvoid landing on an opponent's property. To have more opportunities to buy property. Game it is often best to get out as soon as possible so as Jail Free card, but you can also wait until you roll doubles Get out immediately by paying $50 or by using a Get out of I discovered that it is really necessary to model twoĭifferent strategies. I used an extended version of this program to Probabilities using a Markov matrix, which was the methodĭescribed in a simplified form in the Scientific AmericanĪrticle. Although this gave good aproximate answers, I Rules for going to jail and the Chance and Community ChestĬards. Simulates a single person rolling the dice and moving around I'm not much of a Monopoly® player myself, but I'veĪlways enjoyed interesting problems involving probability I ran into some interesting problems but finallyĬame up with the right answers, which you will find hereĪlong with some other useful derived data. The different squares with all of the rules taken intoĪccount. Working on trying to find the probabilities for landing on I was intrigued enough with this problem that I started Without considering the effects of the Chance and CommunityĬhest cards or of the various ways of being sent to jail. Of landing on the various squares in the game of
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |