Since this problem requires finding all the possible paths, so it cannot be solved using DP as we cannot break this problem into sub-problems. This is kind of graph problem where you can traverse each cell and explore neighbouring cells in all 4 directions via recursion or iteration.