The exact probabilities for turn `t` can be calculated in matlab from the transition matrix as `A^t`

Monopoly games are not infinite. They end out of either fatigue, mutual agreement, or utter defeat at some point. Additionally, there is only so much money in the bank, etc. Considering there is an end point (let’s say, for example, 50 turns is about the extent of it) and that all players (2-6) start on the same square, does this skew the results? For instance, Illinois Ave. may eventually be the most likely square, but it is the most likely square in the first 5, 10, 25, or 50 moves? I highly doubt anyone will want to “go for the reds” if, indeed, the oranges or purples (or light blues) of the world are far more likely to be landed on while the game is in session (rather than 4,300 turns later). Is there a way to calculate probability in certain time increments (every 3 or 5 turns?) rather than an overall metric?

]]>I’m only counting the ultimate endpoint. That’s why there’s zero chance of landing on ‘Go to Jail’.

]]>In line 11 you have:

chestSquares = [3, 34];

There is another Community Chest at square 18. Is this missing or accounted for elsewhere?

Also, just wanted to check something – in transition scenarios, are you counting both the square landed on after dice roll AND the square transitioned to? For example, when the player lands on “Go to Jail”, are you counting both “Go to Jail” and “Jail”, or only the ultimate endpoint (Jail in this example)?

]]>