This is a brain teaser. The rule is we are only allowed to use the the grid line (the border of each box) to reach the destination . Finding the Shortest Path Let's right away find the shortest path to reach the destination. We need to pick only two directions from all four directions: up-down-right-left. And the two must be perpendicular to each other. If we start from the top left, to go diagonally to the bottom right, we will have two options to move, those are: down — right . Other than those, we won't be going on the shortest path. If we start from the bottom left, and we have to reach the top right, then we'll have two options, those are up — right . I put different colors, green and red, so you can see them. In that example, we have 6 steps as our shortest path. How to Actually Get the Shortest Route (Steps)? By counting along the side borders of the grid. Or Adding the total rows and columns. Let's generalize the method....