Watch & Learn

Brain Teaser

Question

In New Math City (NMC), streets follow a square grid with integer coordinates, and all distances are measured in terms of vertical and horizontal units.

Martin, who lives at (−1,−1), often visits his best friend Nika at (2,1). He always takes the shortest possible route as shown.

But that's not the only optimal path. How many shortest routes, including the one above, can Martin choose from?

Problem by Brilliant
Solution by Brilliant
Powered by