### Delia's Routes

A little mouse called Delia lives in a hole in the bottom of a tree.....How many days will it be before Delia has to take the same route again?

### Redblue

Investigate the number of paths you can take from one vertex to another in these 3D shapes. Is it possible to take an odd number and an even number of paths to the same vertex?

### Diagonal Trace

You can trace over all of the diagonals of a pentagon without lifting your pencil and without going over any more than once. Can the same thing be done with a hexagon or with a heptagon?

# Hamilton's Puzzle

## Hamilton's Puzzle

In 1859, the Irish mathematician Sir William Rowan Hamilton devised a puzzle with a regular dodecahedron made of wood. Here is a dodecahedron:

He labelled each of the vertices with the name of an important city. The challenge was to find a route along the edges of the dodecahedron which visited every city exactly once and returned to the start.

Here is a graph which represents the dodecahedron. Can you see how each of the 20 vertices, 30 edges and 12 pentagonal faces is represented in the graph?

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?

Can you find any other ways of making this journey?

Here is a simpler network of countries:

How many different ways are there of visiting each of these countries once and only once, beginning and ending at Australia?

### Possible approach

There are many possible routes in the first part of this problem and finding all of them in a systematic way is perhaps too challenging at this level. Asking the pupils to look for several different paths will hopefully help them realise just how many possibilities there are without the need to find an exhaustive list.

### Possible extension

Pupils may like to make their own Hamiltonian puzzle, labelling each vertex with the name of a city. They could then write a list of the cities in the order you would have to go to visit each once and only once, and challenge a friend to find the route.