Maze: Count all possible paths

Problem Statement:
       Count all the possible paths in the given maze.
            Note: Only right and bottom moves allowed.

Solution: 
Run Source Code     
   We would using recursion to count the possible pats, as (N-1,N-1) is reached count is incremented each time.

Below is logic implemented.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47

/** * Find count of possible paths in the maze * @author PRATEEK */ public class CountPaths { private static int rowLen, colLen, count; public static void paths(int[][] maze, int row, int col) { if (row == rowLen && col == colLen) { count++; return; } /*// move left if (col > 0 && maze[row][col - 1] == 1) paths(maze, row, col - 1);*/ // move right if (col < colLen && maze[row][col + 1] == 1) paths(maze, row, col + 1); /*// move up if (row > 0 && maze[row - 1][col] == 1) paths(maze, row - 1, col);*/ // move down if (row < rowLen && maze[row + 1][col] == 1) paths(maze, row + 1, col); } public static void main(String[] args) { int[][] maze = { {1, 1, 0, 0, 1, 1 }, {1, 1, 1, 1, 0, 0 }, {1, 0, 0, 0, 1, 0 }, {1, 1, 1, 1, 0, 0 }, {1, 0, 1, 0, 0, 0 }, {1, 1, 1, 1, 1, 1 } }; rowLen = maze.length-1; colLen = maze[0].length-1; paths(maze,0,0); System.out.println("Number of Paths: "+count); } }

Please comment and post your suggestions.
Happy Coding !! :)