3,833 reputation
1633
bio website wuerl.calepin.co
location Seattle, WA
age 34
visits member for 3 years, 3 months
seen Apr 13 at 23:17

aerospace engineer, Star Wars nerd, PowerPoint hater, and family barista, @wuerl


Jul
17
answered What is a good board game to use for a programming competition
Jul
11
accepted In Broadside, what is your strategy for placing the shore guns and mines during setup?
Jul
5
accepted What should be considered in constructing a balanced team of investigators?
Jul
3
accepted How does the introduction of victory cities in Axis & Allies revised change gameplay and strategy?
Jul
3
asked What should be considered in constructing a balanced team of investigators?
Jun
27
awarded  Necromancer
Jun
26
awarded  Enthusiast
Jun
24
answered General advice for maximizing fun playing multiple games of Dominion
Jun
23
answered How many units do you use to attack a dead zone in Axis and Allies?
Jun
23
awarded  Convention
Jun
22
revised Sunrise vs. “Summon Eclipse” in Buffy the Vampire Slayer
edited tags
Jun
21
comment How many spins does it take to complete a game of Hi Ho! Cherry-O?
If you make the edit to the code and also put the link to the image in the body we'll edit the post for you. I'd recommend two runs: one for 1-player to prove your code matches the Markov result, and one for 2-player.
Jun
21
revised How many spins does it take to complete a game of Hi Ho! Cherry-O?
added Markov transition matrix to answer
Jun
21
comment How many spins does it take to complete a game of Hi Ho! Cherry-O?
You know what? Good point. The other simulations and the Markov chain example are all answering the question of how many spins it takes to amass 10 cherries, and now that I think about it, that is a totally different question than how many turns (i.e. each player spinning once) it takes to end the game. In fact, I think you're the only person to answer what is really the actual question being asked. I think we could validate your sim by running it with num_players = 1 and seeing if the results match the others.
Jun
21
revised Replacing center cards in Ascension
edited tags
Jun
21
revised How does DeGray's Pilebunker chip work when trashing Gems of size 2+?
edited tags
Jun
21
revised Protecting the surface of your board games…
edited tags
Jun
21
comment How many spins does it take to complete a game of Hi Ho! Cherry-O?
+1 for Markov chains, which is really the only way to analytically model this type of problem, and for finding prior art. I notice everyone else with a correct answer used a Monte Carlo simulation that they had to code up themselves. I wonder what was the fastest, C, Python, or Google. :)
Jun
21
comment How many spins does it take to complete a game of Hi Ho! Cherry-O?
I'm not sure what's wrong with your code, but it doesn't appear to be giving the right results. It sounds like you were attempting the same type of Markov chain approach mentioned in another answer. Perhaps the referenced paper can help.
Jun
21
revised How many spins does it take to complete a game of Hi Ho! Cherry-O?
embedded picture