Find a Path
Can you find a path from a number at the top of this network to the bottom which goes through each of the numbers $1$ to $9$ once and once only?
Which number will you have to end on?
You could make a list of the numbers and cross them out as you use them.
Many of you quickly spotted that in fact there are two ways through the numbers.
Richard from Moorfield Junior said:
The order I came up with is: 7,6,3,8,9,4,5,1,from top to bottom.Richard, Adam and Anthony also from Moorfield sent in this solution too, so did Jack D and Georgia from Tattingstone School.
Year 4 children at St Hilda's School agreed with this but wrote the answer from bottom to top: 1,5,4,9,2,8,3,6,7.
Gideon from Newberries Primary School discovered a different solution which was: 4,6,3,8,2,9,7,5,1 (top to bottom). Jack F and Jake, two more pupils at Tattingstone agree with this.
Philippe Benichou wrote to tell us both solutions. Unfortunately, you didn't let us know how old you are or which school you go to Philippe! Lucas and Julian from the British School in Tokyo also found the two paths. Well done!