> The second was a Monopoly simulation that just ran around the board to estimate which squares were landed on most often.
This was one my most significant works in HS. I think I used a BASIC compiler for my Apple IIc so it could run faster. I felt powerful solving problems that could only be solved via Monte Carlo methods* and took a long time to compute.
* I am aware you can compute long run landing probs via matrix calcs. However, this matrix gets yuge when you factor in some sort of probability distribution for how long a player decides to stay in jail for (either roll out or pay your way out). This is someone similar in shape, but not scope, when Eli talks about Combinatorial simulation - the game of SET.