25 students are queuing in a straight line. How many are there between Julia and Jenny?
As you come down the ladders of the Tall Tower you collect useful spells. Which way should you go to collect the most spells?
Move from the START to the FINISH by moving across or down to the next square. Can you find a route to make these totals?
A dog is looking for a good place to bury his bone. Can you work out where he started and ended in each case? What possible routes could he have taken?
Can you draw a continuous line through 16 numbers on this grid so that the total of the numbers you pass through is as high as possible?
I start my journey in Rio de Janeiro and visit all the cities as Hamilton described, passing through Canberra before Madrid, and then returning to Rio. What route could I have taken?
A Hamiltonian circuit is a continuous path in a graph that passes through each of the vertices exactly once and returns to the start. How many Hamiltonian circuits can you find in these graphs?
Euler discussed whether or not it was possible to stroll around Koenigsberg crossing each of its seven bridges exactly once. Experiment with different numbers of islands and bridges.
If you can copy a network without lifting your pen off the paper and without drawing any line twice, then it is traversable. Decide which of these diagrams are traversable.
How many ways are there to count 1 - 2 - 3 in the array of triangular numbers? What happens with larger arrays? Can you predict for any size array?
A ribbon runs around a box so that it makes a complete loop with two parallel pieces of ribbon on the top. How long will the ribbon be?
A spider is sitting in the middle of one of the smallest walls in a room and a fly is resting beside the window. What is the shortest distance the spider would have to crawl to catch the fly?
Given the graph of a supply network and the maximum capacity for flow in each section find the maximum flow across the network.
How many tours visit each vertex of a cube once and only once? How many return to the starting point?
Given probabilities of taking paths in a graph from each node, use matrix multiplication to find the probability of going from one vertex to another in 2 stages, or 3, or 4 or even 100.