In the game, Monopoly, find the three most popular squares when using two 4-sided dice.
This marks my return(?) to Eulering. I did a lot of research for this a long time ago, and was planning on implementing a Markov chain approach based on the results from this page but after falling for the trap of googling for solutions I found that most people simply simulate the dice rolls, counting the number of times the dice hits each cell.
I simulated 1 million throws and got a result in about 5 seconds.