Sociable Cards
Sociable Cards printable sheet
Take a pack of cards and remove the Jacks, Queens and Kings.
Shuffle the remaining cards, and then lay the whole pack face up on the table in a snake, like this one:
Place four different coloured counters on the first four cards in the snake. Then move each counter foward the number shown on its card (Aces count as $1$). Keep moving each counter until it can't go any further without going off the end.
Watch the video below to see a demonstration:
Did your counters all finish on different cards?
Repeat the experiment a few times.
How often did all the counters finish on different cards?
How often did they all finish on the same card?
Can you explain your results?
Challenge
Find a way to arrange the cards so that all four counters finish on different cards.
Can you do the same with five counters?
This problem is based on a card trick called Kruskal's Count
Try a few different 'snakes' and make a note of the cards you land on as you move through the 'snake'.
Ed from St Peter's College noticed a pattern:
Most of the counters landed on the same card but there was one counter which landed on a different card. We repeated this game three times and in total four counters landed on differnt cards. In one instance the counters all finished on the same card. This happens because every card has a different number, so they all land on the same numbered cards, so that again would change their path to the same card. From this we have gathered that counters do land on the same card most times. :D
Tom from Wilson School developed a strategy:
You could put all the high numbers near the start and the low numbers nearer the end so that some will land on the end one some may not, it would be best to do a mixture of aces at the end. However if you did only aces near the end you would get all your counters to the end. The last card would have to be 1 more than you have to move. If it is one until the end you would have to put a number two there; if you were two from the end, a number 3 and so on.Joshua from Chesham Preparatory School had a similar idea and found a precise solution through trial and error:
Solution for counters on different cards: 1. Random start but this was not useful. 2. We found out that aces, twos and threes (low cards) weren't helpful as they put the counters onto the same or close cards. 3. We tried 2 different methods to resolve the problem of having 1 counter per card. 4. Our successful method was: - the same high number one after each other - then low numbers (which would be skipped) We carried on this technique until none of the counters could move on. List of cards: 4 tens, 4 aces, 2 twos, 4 nines, 2 twos, 3 threes, 4 eights, 3 fours, 1 three, 4 sevens, 1 four, 2 fives, 4 sixes and 2 fives. This method worked successfully!
It is worth noting that if two counters end up on the same spot after a few steps, they are going to end up in the same place when the game is over. This might make the trial and error a bit faster.
The Maths Club at King Solomon Academy noted:
Our results have proven that it is possible to land all four counters on the same final card. This we believe is due to the starting cards, which are all odd or are all even. However we found out that if you have a mixture of both odd and even in the first four cards our results will be varied. Firstly, if the sequence of the first four cards are odd, odd, even, even, then the three of the counters will land on the same card and one will land on a separate card. Secondly, we realised that if the first four cards were odd, odd, odd, even then all of them will land on the same card apart from one.
Strangely, we found out that our predictions were proven wrong as we thought that if the four starting cards were odd, even, even, even, three counters would land on the same card. The experiment completely proved this theory wrong as the results show that all cards landed on the same final card.
The way the Maths Club came up with theories, tested them and then tried to further and improve is a useful technique. Well done to you all!
Can anyone develop a more rigourous approach?
Why do this problem?
This problem is one of a set of problems about probability and uncertainty. Intuition can often let us down when working on probability; these problems have been designed to provoke discussions that challenge commonly-held misconceptions. Read more in this article.
Possible approach
Arrange learners in groups of 4, with a pack of cards and some counters for each group. Ask them to remove the Jacks, Queens and Kings, and then shuffle the remaining cards. Explain how to set up the 'snake' and then ask them to put a different counter on each of the first four cards. Once they have chosen a counter each, get them to see how far they can each go before falling off the end.
| All counters on the same card | |
| Three counters on the same card | |
| Two pairs of counters on two cards | |
| Two counters on the same card | |
| All counters on different cards |
Finally, allow some time for learners to work on the challenge of finding a snake where all four (and then five) counters end up on different cards.
Key questions
Where did your counters end up?
Possible support
The initial task should be accessible to all. When planning a way to use the activity as a fundraiser, less confident learners could be encouraged to restrict the winning options. For example, they could explore pricing structures for a game that only pays out when all participants land on different cards.
Possible extension
Retiring to Paradise provides a different context for considering the importance of spread as well as average when working with data.