## Notes from an Inspector's Notebook: March 2006In March 2006 I received an email from John which had an air of excitement. It is reproduced below. The problem exists in our collection as Task 46,Greedy Pig (Task 200) re-awakened my interest in probability and other bits of mathematics which seem to me to be counter intuitive. While trying to support a trainee teacher last week I was introduced to a beauty. She had given out the following investigation sheet, told the class to work in pairs and provided each pair with three dice marked up as required.
After 20 minutes or so each pair came up with the result that in order to win you must be the second player, ie: the one that chooses from two, not three, dice.
All this reminded me of a similar problem that I had had in my notebook for a number of years and to which I had no satisfactory solution. The problem was to select a dice from a set of four with the best possible chance of winning over any of the others. Of course the dice are marked up in odd ways: Dice A: 3 3 3 3 3 3At last I had a good method, obtained from my exploration of the three dice game above, and a good use for adding and multiplying fractions! And not only could I select the right dice, but I could rank them in order of their winning chances. Better perhaps to play the games (A v B, A v C, A v D, B v C, B v D and C v D) but good to be able to prove the theoretical results and disprove all those who said all I needed to do was find the average possible score for each dice in order to rank them. And why do my diagrams remind me of the handshake problem?
Follow this link to Task Centre Home page. |