Routes and Networks - July 2004, Stage 2&3

Problems

problem icon

Paw Prints

Stage: 2 Challenge Level: Challenge Level:1

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?

problem icon

A Numbered Route

Stage: 2 Challenge Level: Challenge Level:2 Challenge Level:2

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?

problem icon

Hamilton's Puzzle

Stage: 2 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

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?

problem icon

Travelling Salesman

Stage: 3 Challenge Level: Challenge Level:1

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?

problem icon

Konigsberg Plus

Stage: 3 Challenge Level: Challenge Level:2 Challenge Level:2

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.

problem icon

Tourism

Stage: 3 Challenge Level: Challenge Level:3 Challenge Level:3 Challenge Level:3

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.