![]() I suspect this could be programmed and solved. This is equivalent to the number of subsets from the means getting 1 roll each for 2, 5, and 9). ![]() Now we have to count the probabilities for all the combinations of getting the other rolls. ![]() (Prob = (1/6)(1/6) = 1/36)Īnother way is to get 2 rolls for 7, 1 roll for any other number (The prob of two 7s is 1/36. What is the probability that snail 7 will win? For example, let's say the race needs 2 steps to win. I think it can be calculated explicitly, but I do not know of any shortcut. Off the top of my head, this is an example of a Negative Binomial Distribution (). I have spent plenty of time on this, and would love to engage in a maths conversation with someone who is keen to shed some light on this problem. I have made some calculations but as yet not been able to come up with a reasonable answer. The awesome part about this is it all started because student asked "what chance does 7 actually have of winning?" so our class is invested and I’m at my wits end with an answer. I have put my evenings and free-time into trying to do a full analyse of snail 7's chances of winning. Yes, it is the favorite, but just because has a 1/6 chance of moving forward at each dice-roll (higher then all others) it obviously does not mean it has a 1/6 chance of winning the entire race. We have noticed that snail 7 wins most of the time. My Mathematical brain wants to know more about the game. We are touching on the basics of probability in our class and this game suits us perfectly. I currently teach a class of 12-13 year olds and we have been analyzing the Snail Racing game for our topic on probability. Thank you so much for your amazing efforts in helping students worldwide achieve in Mathematics. "I am a young Maths teacher in Wellington, NZ, love your site and it regularly to engage my students. How did you use this resource? Can you suggest how teachers could present or develop this resource?
0 Comments
Leave a Reply. |