Riddles, brain puzzles and mathematical problems

[Romulator]

Problem 1:
Consider this a game.
Starting from the square on the top left corner (marked as green) you must end up in the bottom right square (marked as red). The rules you must follow are the following:

• You can only move up, left, down or right.
  
• The number on the square is the exact number of moves you can make each time before stoping on a square. For example from the start you can go two steps on the right an land on the 3. From there you can go two steps down and one right and land on the 1, and so on.
  

Can you find a solution? What is the best solution? Or equivalently what is the route with the minimum number of steps?
If you feel like it, write an algorithm or a computer program that finds the best possible route (or routes).

Probably a faster way, but in five minutes, I deduced;

Spoiler below!

2 right (land on 3)
3 down (land on 3)
2 right + 1 down (land on 4)
3 right + 1 down (land on 4)
4 right (land in red square)
Total: 16

2 minutes later, found;
2 right (land on 3)
3 right (land on 4)
1 left + 2 down + 1 right (land on 3)
3 down (land in red square)
Total: 12

First way I found, in prepping for Sociology class.