Across the Grid
The puzzle
A town is laid out as a 4 by 4 grid of blocks. You walk from the south-west corner to the north-east corner, only ever heading east or north.
How many different routes are there?
Stuck?
One at a time, smallest first. Open only as many as you need — the whole point of the puzzle is the part you work out yourself.
Hint 1
Every route is exactly 8 blocks long: 4 east and 4 north.
Hint 2
A route is just a decision about WHICH of the eight steps are the eastward ones.
Show the answer Hide the answer
70 routes.
How to get there
Every route consists of 4 east steps and 4 north steps in some order - 8 steps in total, because no route can be shorter or longer while heading only east and north.
A route is therefore determined by choosing which 4 of the 8 steps are eastward. That is C(8,4) = 8×7×6×5/(4×3×2×1) = 70.
The grid itself confirms it if you prefer: write 1 along the bottom row and the left column, then fill each junction with the sum of the one below and the one to its left. The corner comes out 70, and the numbers you have written are Pascal's triangle lying on its side.
The technique worth keeping
Convert a route into a sequence of symbols, then count the arrangements of that sequence. "Which steps go east" turns a path-counting problem into a single binomial coefficient.