This site uses different types of cookies, including analytics and functional cookies (its own and from other sites). To change your cookie settings or find out more, click here. If you continue browsing our website, you accept these cookies.
We're actively looking for ideas on how to improve Weekly Challenges and would love to hear what you think!
Submit FeedbackI modeled the board and then Monte Carlo'd until the pins wore off.
Like @patrick_digan, @jamielaird and @Kenda, I found the bounded model produces higher probabilities that token will end up in Bucket 1 or 5 if started in those columns
Dan
My solution.
Ummm wow, this one was exhausting for me.
Glad to know the posted solution looked up a pascal triangle because I spent a good half hour trying to manually count the paths to each space and gave up after a bit. Definitely not proud of my efficiency on this one. I walked away and came back to it on and off for 3 days researching different articles on Plinko probability.
So here it is, Didn't bother with the bonus, mostly cause i was burnt out by the time i got to the solution. Just glad to just check the box on this one and be done. :) No offense
I imagine you could add some interface tools on this approach to adjust the size of triangle you put through the calculation.
Cheers!
Finally got it (I think...)
You input start column (in letters - A to E) and it gives you the output...
I went with an iterative macro which runs 1000 simulations for each starting position, and then works out the % of iterations which ended in the winning position. Worked with @George_Walker on this one :)
Hi! Here my solution :)
That took a while but eventually got there. First built a macro that builds Pascal's Triangle, then built a batch macro that calculates the chances of reaching each bin. The batch macro can be customised on the number of slots and number of rows.
Here's my solution to challenge 73!
I created an iterative macro that will allow you to decide the number of stages and tell you the probability of landing in any given position from any given space.
I define a stage as two sets of pegs - so every time the pegs line up to match the first row of pegs, that's a new stage.
I'm really happy with this as it took a lot of work to figure out how to iterate properly and figure out a cheeky way of passing multiple fields back in a single field (concat, pass back, seperate)!