Faced this variation of standard problem in an interview:
Given a 2-D grid ( assume in the first quadrant of X-Y plane) , we have to move from ( 0,0) to (N,N). We have 3 moves allowed- up, right, down.
Also, assume that in a particular path, no cell is repeated. ( So that there is no path of infinite length ). We can solve this using DFS.

However, Is there any DP solution for this ?