mscroggs.co.uk
mscroggs.co.uk

subscribe

Blog

Archive

Show me a random blog post
 2019 
 2018 
 2017 
 2016 
 2015 
 2014 
 2013 
 2012 

Tags

accuracy royal baby hats final fantasy stickers manchester science festival matt parker game show probability world cup misleading statistics arithmetic geometry javascript news martin gardner the aperiodical cross stitch twitter oeis interpolation golden ratio manchester draughts aperiodical big internet math-off palindromes craft sound dates nine men's morris pythagoras noughts and crosses puzzles coins harriss spiral propositional calculus binary estimation chebyshev london underground curvature rhombicuboctahedron national lottery books dragon curves graph theory flexagons python data bodmas php menace logic sorting frobel inline code plastic ratio pizza cutting countdown map projections people maths sport go pac-man game of life bubble bobble wool machine learning christmas card dataset programming statistics ternary platonic solids chess mathsteroids golden spiral folding paper captain scarlet light triangles reddit chalkdust magazine mathslogicbot polynomials braiding latex tennis games hexapawn radio 4 speed approximation asteroids christmas probability realhats london fractals folding tube maps rugby raspberry pi reuleaux polygons a gamut of games gerry anderson error bars weather station european cup electromagnetic field video games football trigonometry

Archive

Show me a random blog post
▼ show ▼
 2014-04-11 
As well as letters games, the contestants on Countdown also take part in numbers games. Six numbers are chosen from the large numbers (25,50,75,100) and small numbers (1-10, two cards for each number) and a total between 101 and 999 (inclusive) is chosen by CECIL. The contestants then use the six numbers, with multiplication, addition, subtraction and division, to get as close to the target number as possible.
The best way to win the numbers game is to get the target exactly. This got me wondering: is there a combination of numbers which allows you to get every total between 101 and 999? And which combination of large and small numbers should be picked to give the highest chance of being able to get the target?
To work this out, I got my computer to go through every possible combination of numbers, trying every combination of operations. (I had to leave this running overnight as there are a lot of combinations!)

Getting every total

There are 61 combinations of numbers which allow every total to be obtained. These include the following (click to see how each total can be made):
By contrast, the following combination allows no totals between 101 and 999 to be reached:
The number of attainable targets for each set of numbers can be found here.

Probability of being able to reach the target

Some combinations of numbers are more likely than others. For example, 1 2 25 50 75 100 is four times as likely as 1 1 25 50 75 100, as (ignoring re-orderings) in the first combination, there are two choices for the 1 tile and 2 tile, but in the second combination there is only one choice for each 1 tile. Different ordering of tiles can be ignored as each combination with the same number of large tiles will have the same number of orderings.
By taking into account the relative probability of each combination, the following probabilities can be found:
Number of large numbersProbability of being able to reach target
00.964463439
10.983830962
20.993277819
30.985770510
40.859709475
So, in order to maximise the probability of being able to reach the target, two large numbers should be chosen.
However, as this will mean that your opponent will also be able to reach the target, a better strategy might be to pick no large numbers or four large numbers and get closer to the target than your opponent, especially if you have practised pulling off answers like this.
Edit: Numbers corrected.
Edit: The code used to calculate the numbers in this post can now be found here.

Similar posts

Countdown probability
Pointless probability
World Cup stickers 2018, pt. 3
World Cup stickers 2018, pt. 2

Comments

Comments in green were written by me. Comments in blue were not written by me.
 2016-07-20 
@Francis Galiegue: I've pushed a version of the code to https://github.com/mscroggs/countdown-numbers-game
Reply
Matthew
 2016-07-20 
@Francis Galiegue: Sadly, I lost the code I used when I had laptop problems. However, I can remember what it did, so I shall recreate it and put it on GitHub.
Reply
Matthew
 2016-07-20 
If you could, I'd love to have the code you used to do this exhaustive search?

I'm a fan of the game myself (but then I'm French, so to me it's the original, "Des chiffres et des lettres"), but for the numbers game, this is pretty much irrelevant to the language and country :)
Reply
Francis Galiegue
 Add a Comment 


I will only use your email address to reply to your comment (if a reply is needed).

Allowed HTML tags: <br> <a> <small> <b> <i> <s> <sup> <sub> <u> <spoiler> <ul> <ol> <li>
To prove you are not a spam bot, please type "prime" in the box below (case sensitive):
 2014-04-06 
On Countdown, contestants have to make words from nine letters. The contestants take turns to choose how many vowels and consonants they would like. This got me wondering which was the best combination to pick in order to get a nine letter word.
Assuming the letters in countdown are still distributed like this, the probability of getting combinations of letters can be calculated. As the probability throughout the game is dependent on which letters have been picked, I have worked out the probability of getting a nine letter word on the first letters game.

The probability of YODELLING

YODELLING has three vowels and six consonants. There are 6 (3!) ways in which the vowels could be ordered and 720 (6!) ways in which the consonants can be ordered, although each is repeated at there are two Ls, so there are 360 distinct ways to order the consonants. The probability of each of these is:
$$\frac{21\times 13\times 13\times 6\times 3\times 5\times 4\times 8\times 1}{67\times 66\times 65\times 74\times 73\times 72\times 71\times 70\times 69}$$
So the probability of getting YODELLING is:
$$\frac{6\times 360\times 21\times 13\times 13\times 6\times 3\times 5\times 4\times 8\times 1}{67\times 66\times 65\times 74\times 73\times 72\times 71\times 70\times 69} = 0.000000575874154$$

The probability of any nine letter word

I got my computer to find the probability of every nine letter word and found the following probabilities:
ConsonantsVowelsProbability of nine letter word
090
180
270
360.000546
450.019724
540.076895
630.051417
720.005662
810.000033
900
So the best way to get a nine letter word in the first letters game is to pick five consonants and four vowels.

Similar posts

Countdown probability, pt. 2
Pointless probability
World Cup stickers 2018, pt. 3
World Cup stickers 2018, pt. 2

Comments

Comments in green were written by me. Comments in blue were not written by me.
 Add a Comment 


I will only use your email address to reply to your comment (if a reply is needed).

Allowed HTML tags: <br> <a> <small> <b> <i> <s> <sup> <sub> <u> <spoiler> <ul> <ol> <li>
To prove you are not a spam bot, please type "segment" in the box below (case sensitive):
 2013-12-15 
Last week, I was watching Pointless and began wondering how likely it is that a show features four new teams.
On the show, teams are given two chances to get to the final—if they are knocked out before the final round on their first appearance, then they return the following episode. In all the following, I assumed that there was an equal chance of all teams winning.
If there are four new teams on a episode, then one of these will win and not return and the other three will return. Therefore the next episode will have one new team (with probability 1). If there are three new teams on an episode: one of the new teams could win, meaning two teams return and two new teams on the next episode (with probability 3/4); or the returning team could win, meaning that there would only one new team on the next episode. These probabilities, and those for other numbers of teams are shown in the table below:
 No of new teams today
Noof new teams tomorrow
  1234
100\(\frac{1}{4}\)1
20\(\frac{1}{2}\)\(\frac{3}{4}\)0
3\(\frac{3}{4}\)\(\frac{1}{2}\)00
4\(\frac{1}{4}\)000
Call the probability of an episode having one, two, three or four new teams \(P_1\), \(P_2\), \(P_3\) and \(P_4\) respectively. After a few episodes, the following must be satisfied:
$$P_1=\frac{1}{4}P_3+P_4$$ $$P_2=\frac{1}{2}P_2+\frac{3}{4}P_3$$ $$P_3=\frac{3}{4}P_3+\frac{1}{2}P_4$$ $$P_4=\frac{1}{4}P_1$$
And the total probability must be one:
$$P_1+P_2+P_3+P_4=1$$
These simultaneous equations can be solved to find that:
$$P_1=\frac{4}{35}$$ $$P_2=\frac{18}{35}$$ $$P_3=\frac{12}{35}$$ $$P_4=\frac{1}{35}$$
So the probability that all the teams on an episode of Pointless are new is one in 35, meaning that once in every 35 episodes we should expect to see all new teams.
Edit: This blog answered the same question in a slightly different way before I got here.

Similar posts

Countdown probability, pt. 2
Countdown probability
World Cup stickers 2018, pt. 3
World Cup stickers 2018, pt. 2

Comments

Comments in green were written by me. Comments in blue were not written by me.
 Add a Comment 


I will only use your email address to reply to your comment (if a reply is needed).

Allowed HTML tags: <br> <a> <small> <b> <i> <s> <sup> <sub> <u> <spoiler> <ul> <ol> <li>
To prove you are not a spam bot, please type "pmuj" backwards in the box below (case sensitive):
© Matthew Scroggs 2019