Project Euler problem 84

Solution to Project Euler problem 84.
Decide the most likely squares to visit in a game of Monopoly using -sided dice.

GO A1 CC1 A2 T1 R1 B1 CH1 B2 B3 JAIL
H2 🎩 C1
T2U1
H1C2
CH3C3
R4R2
G3D1
CC3CC2
G2D2
G1D3
G2J F3 U2 F2 F1 R3 E3 E2 CH2 E1 FP

Round:


Probabilities:


Six-digit string: