About Board Odds
In a property-trading board game you go round and round a ring of 40 squares, so you might expect to land on every square equally often. You don't. This app works out how often each move ends on each square, in the long run, and paints the board as a heat map: the hotter the colour, the more often players stop there. Hover over or tap a square for its share and its rank. The chart on the right shows every square, a ranked list, or the colour groups added up.
Leaving jail changes the answer: you can pay to leave at once, or stay in and roll for a double for up to three turns. SIMULATE plays up to a million turns with real shuffled decks, so you can watch the simulated shares settle onto the expected ones. Keys: R runs or stops, J switches the jail rule, M switches the board between Expected and Simulated.
It uses the layout of the classic 1930s property-trading game (which squares are cards, taxes, stations and so on) and the cards of its British edition (7 of the 16 Luck cards and 3 of the 16 Fortune cards move you), with plain names: Start, Luck and Fortune cards, Stations 1 to 4, Power and Water, and colour groups numbered round the board.
THE STORY
The game grew out of The Landlord's Game, which Elizabeth Magie patented in 1904 to show how land rents enrich owners. Players made their own home-made versions for years before the famous edition was sold in the 1930s.
People have long asked which squares are worth buying. In 1972 Robert Ash and Richard Bishop worked out the long-run chances of landing on each square with exactly this kind of calculation (a Markov chain), and many people have refined it since. The well-known answers: Jail is by far the busiest corner; the third red square is the most landed-on property; and the orange group is the best set for its money, because it sits 6 to 9 squares past Jail, and 6, 7 and 8 are the most likely totals of two dice.
HOW IT WORKS
Each move is one throw of two dice. The calculation keeps track of where you are and how many doubles you've thrown this turn (a double throws again; the third double in a row sends you to jail), and while you're in jail, how many tries you've had. From each of those states it works out every way the next throw can go: the 36 ways two dice can land, then any card or Go to Jail square that moves you on. Then it finds the long-run share of moves that end in each state, by starting everywhere at once and stepping forward until nothing changes. These are the Expected figures.
One shortcut: the calculation treats every card as drawn at random from a full deck each time, the usual approximation. In the real game the deck goes round in order, which the simulation copies (each deck is shuffled, read card by card and shuffled again when it runs out), and the two agree to a few hundredths of a percent. The "keep this card to get out of jail" cards are counted as ordinary cards that don't move you.
Why does Jail help its neighbours? About 1 move in 25 ends with someone sent to jail (more if they stay in), and they all leave from the same square. The commonest total of two dice is 7 (6 of the 36 ways), then 6 and 8, so the squares 5 to 9 past Jail, the orange group and the station before it, get extra traffic. The Luck and Fortune squares score low because their cards can send you away: 7 times in 16 on Luck, 3 times in 16 on Fortune.
FURTHER WATCHING AND READING