Which algorithm to use in C++?

Hello friends I have the following task and let me know which algorithm to use to solve?

Given an NxN size plane is to calculate the number of possible paths from one point to another. The types of moves that can be made are to the right, down and diagonally at an angle of 315 ° (ie to the right and below).

Suppose the case of a 5x5 size plane and is to calculate the number of paths from the point (2,3) to the point (4,4)

in this URL a example image of the problem:
It there obstacles on board? If not, your problem is trivial.
does not have any obstacles!!!
Thanks MiiNiPaa, this a good solutions, im review.

Topic archived. No new replies allowed.