### Simple Train Journeys

How many different journeys could you make if you were going to visit four stations in this network? How about if there were five stations? Can you predict the number of journeys for seven stations?

### Train Routes

This train line has two tracks which cross at different points. Can you find all the routes that end at Cheston?

### How Many Pieces?

How many loops of string have been used to make these patterns?

# Late Again

##### Stage: 1 Challenge Level:

David from Thomas Reade School sent in the following solution:

The shortest route is forward $1$, right $1$, forward $6$ and right $3$ which is $11$ spaces.
Another way is forward $1$, right $4$ and forward $6$ which is $11$ spaces.
Another way is forward $3$, right $4$ and forward $4$ which is $11$ spaces.

(This assumes that Moira is standing just outside the school gate and finished standing outside the school doors.) Thank you David.