Problem
The board shown has cells, one of which is labelled and another . The shortest path starting at and finishing at involves exactly nine other cells and ten moves, where each move goes from cell to cell 'horizontally' or 'vertically' across an edge. How many paths of this length are there from to ?
Sign in or create an account to reveal answers, view the solution, and save your progress. Create a free account to unlock practice and keep track of your work.
Junior Mathematical Olympiad 2016 (2016)
One puzzle per day. Cryptarithm, Magic Square, Summit. No sign-up required to play.
Play daily puzzle →Interactive problems and curated lessons—water pouring, magic squares, knight's tour, and more.
Browse library →See how you rank. Top solvers by problems solved correctly. Sign in to climb the ranks.
View leaderboard →Junior Mathematical Olympiad 2016 (2016)