Strategy
How many ways are there of moving from A to N in the diagram below?
If you try to solve this puzzle by counting the routes one by one it could take some time. A good strategy for tackling any difficult problem is to try a simpler one of the same type first. In this case, we could begin by counting the number of routes from A to F. We could be even more systematic and find the number of routes from A to B, A to C, A to D, A to E, etc.
Noticing that the answer to F is related to the answers for E, B and C should help you solve the whole puzzle quite quickly.
Now see if you can use a similar method to find the number of ways of spelling out the word STRATEGY in this diagram:
S | T | R | A | T |
T | R | A | T | E |
R | A | T | E | G |
A | T | E | G | Y |
