{"id":25580,"date":"2017-10-15T19:25:16","date_gmt":"2017-10-15T13:55:16","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25580"},"modified":"2017-10-15T19:25:16","modified_gmt":"2017-10-15T13:55:16","slug":"backtracking-set-2-rat-maze-2-2","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/backtracking-set-2-rat-maze-2-2\/","title":{"rendered":"JAVA Programming-Backtracking Set 2 (Rat in a Maze)"},"content":{"rendered":"

We have discussed Backtracking and Knight\u2019s tour problem in Set 1<\/a>. Let us discuss Rat in a Maze <\/a>as another example problem that can be solved using Backtracking.<\/span><\/p>\n

A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N-1][N-1]. A rat starts from source and has to reach destination. The rat can move only in two directions: forward and down.
\nIn the maze matrix, 0 means the block is dead end and 1 means the block can be used in the path from source to destination. Note that this is a simple version of the typical Maze problem. For example, a more complex version can be that the rat can move in 4 directions and a more complex version can be with limited number of moves.<\/p>\n

Following is an example maze.<\/p>\n

Gray blocks are dead ends (value = 0).<\/pre>\n
\"Rat<\/p>\n
Following is binary matrix representation of the above maze.<\/p>\n
                {1, 0, 0, 0}\r\n                {1, 1, 0, 1}\r\n                {0, 1, 0, 0}\r\n                {1, 1, 1, 1}<\/pre>\n
Following is maze with highlighted solution path.<\/p>\n
\"Rat<\/p>\n
Following is the solution matrix (output of program) for the above input matrx.<\/p>\n
                {1, 0, 0, 0}\r\n                {1, 1, 0, 0}\r\n                {0, 1, 0, 0}\r\n                {0, 1, 1, 1}\r\n All enteries in solution path are marked as 1.<\/pre>\n[ad type=”banner”]\n
Naive Algorithm<\/strong>
\nThe Naive Algorithm is to generate all paths from source to destination and one by one check if the generated path satisfies the constraints.<\/p>\n
while there are untried paths\r\n{\r\n   generate the next path\r\n   if this path has all blocks as 1\r\n   {\r\n      print this path;\r\n   }\r\n}<\/pre>\n
Backtrackng Algorithm<\/strong><\/p>\n
If destination is reached\r\n    print the solution matrix\r\nElse\r\n   a) Mark current cell in solution matrix as 1. \r\n   b) Move forward in horizontal direction and recursively check if this \r\n       move leads to a solution. \r\n   c) If the move chosen in the above step doesn't lead to a solution\r\n       then move down and check if  this move leads to a solution. \r\n   d) If none of the above solutions work then unmark this cell as 0 \r\n       (BACKTRACK) and return false.\r\n<\/pre>\n
Implementation of Backtracking solution<\/strong><\/p>\n
 
 java<\/span> <\/div> 
\/* Java program to solve Rat in a Maze problem using   backtracking *\/ public class RatMaze{    final int N = 4;     \/* A utility function to print solution matrix       sol[N][N] *\/    void printSolution(int sol[][])    {        for (int i = 0; i < N; i++)        {            for (int j = 0; j < N; j++)                System.out.print(" " + sol[i][j] +                                 " ");            System.out.println();        }    }     \/* A utility function to check if x,y is valid        index for N*N maze *\/    boolean isSafe(int maze[][], int x, int y)    {        \/\/ if (x,y outside maze) return false        return (x >= 0 && x < N && y >= 0 &&                y < N && maze[x][y] == 1);    }     \/* This function solves the Maze problem using       Backtracking. It mainly uses solveMazeUtil()       to solve the problem. It returns false if no       path is possible, otherwise return true and       prints the path in the form of 1s. Please note       that there may be more than one solutions, this       function prints one of the feasible solutions.*\/    boolean solveMaze(int maze[][])    {        int sol[][] = {{0, 0, 0, 0},            {0, 0, 0, 0},            {0, 0, 0, 0},            {0, 0, 0, 0}        };         if (solveMazeUtil(maze, 0, 0, sol) == false)        {            System.out.print("Solution doesn't exist");            return false;        }         printSolution(sol);        return true;    }     \/* A recursive utility function to solve Maze       problem *\/    boolean solveMazeUtil(int maze[][], int x, int y,                          int sol[][])    {        \/\/ if (x,y is goal) return true        if (x == N - 1 && y == N - 1)        {            sol[x][y] = 1;            return true;        }         \/\/ Check if maze[x][y] is valid        if (isSafe(maze, x, y) == true)        {            \/\/ mark x,y as part of solution path            sol[x][y] = 1;             \/* Move forward in x direction *\/            if (solveMazeUtil(maze, x + 1, y, sol))                return true;             \/* If moving in x direction doesn't give               solution then  Move down in y direction *\/            if (solveMazeUtil(maze, x, y + 1, sol))                return true;             \/* If none of the above movements work then               BACKTRACK: unmark x,y as part of solution               path *\/            sol[x][y] = 0;            return false;        }         return false;    }     public static void main(String args[])    {        RatMaze rat = new RatMaze();        int maze[][] = {{1, 0, 0, 0},            {1, 1, 0, 1},            {0, 1, 0, 0},            {1, 1, 1, 1}        };        rat.solveMaze(maze);    }}<\/code><\/pre> <\/div>\n
Output: The 1 values show the path for rat<\/p>\n
 1  0  0  0 \r\n 1  1  0  0 \r\n 0  1  0  0 \r\n 0  1  1  1<\/pre>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
JAVA Programming-Backtracking Set 2 (Rat in a Maze) – Backtracking – A Maze is given as N*N binary matrix of blocks where source block is the upper left most block i.e., maze[0][0] and destination block is lower rightmost block i.e., maze[N-1][N-1]. <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[73907,1,2139],"tags":[73908,74160,74164,73915,74162,74154,74163,74146,74166],"class_list":["post-25580","post","type-post","status-publish","format-standard","hentry","category-backtracking-algorithm","category-coding","category-java","tag-backtracking-algorithm","tag-backtracking-algorithm-example","tag-backtracking-algorithm-pdf","tag-backtracking-algorithm-tutorial","tag-backtracking-problems","tag-dynamic-programming-geeksforgeeks","tag-graph-coloring-using-backtracking","tag-maze-solving-algorithm","tag-reverse-a-doubly-linked-list"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25580","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=25580"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/25580\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=25580"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=25580"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=25580"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}