Skip to main content

Ant in a Maze problem

Ant in a maze is another problem that can be solved using backtracking algorithm.In this problem there is a NxN  maze in which one corner of maze is entry point and other is exit point.Now there is an ant in a maze who wants to go from entry to exit.For doing this there are certain constraints like an ant can move only forward or downward but no backward and upward.For the sake of simplicity we are taking 4x4 Maze.The maze can be denoted by a matrix with values 0 and 1.0 means the path is blocked and 1 means the path is available.The maze and the path for ant from entry to exit is


The block which are in grey color are dead end in the maze that is the ant cannot go through such blocks.The red path is the path travelled by ant from entry to exit.The matrix representation of the above maze without the path will be (input to be taken)

maze[4][4]={{1,1,0,0},
{1,1,0,1},
{0,1,0,0},
{1,1,1,1}
}

and the matrix representation of path travelled by ant will be (output to be displayed)

Path[4][4]={{1,1,0,0},
{0,1,0,0},
{0,1,0,0},
{0,1,1,1}
}

Algorithm :

1) Mark current block in a matrix as 1
2) Move horizontally in forward direction and recursively check whether this leads to solution.
3) If the above step doesn't lead to the valid solution then move downwards and check whether this leads to the solution.
4) If none of the above solutions work then unmark the block as 0 and return false.

Program :

#include<stdio.h>
#include<conio.h>


bool Findpath(int maze[4][4], int x, int y, int Path[4][4])
{
    
    if(x == 3 && y == 3)           //Exit point is reached
    {
        Path[x][y] = 1;
        return true;
    }

   
    if(isvalid(maze, x, y) == true)     // Check if maze[x][y] is valid
    {
        
        Path[x][y] = 1;                        // mark x,y as part of solution

        
        if (Findpath(maze, x+1, y, Path) == true)     // Move forward in x direction
            return true;

        
           
        if (Findpath(maze, x, y+1, Path) == true)     // If moving in x direction doesn't give solution Move down 
            return true;

         
            
        Path[x][y] = 0;     // If the above steps didn't work then Backtrack that is unmark x,y as part of solution
        return false;
    }   
 printpath(Path);
    return false;
}


bool isvalid(int maze[4][4], int x, int y)
{
   
    if(x >= 0 && x < 4 && y >= 0 && y < 4)             // if x,y is inside maze then return true
{  
   if(maze[x][y]==1)
        return true;
 }
    return false;
}

void printpath(int Path[4][4])
{
    for (int i = 0; i < 4; i++)
    {
        for (int j = 0; j < 4; j++)
            printf(" %d ", Path[i][j]);
        printf("\n");
    }
}

int main()
{
    int maze[4][4]  =  { {1, 1, 0, 0},
        {1, 1, 0, 1},
        {0, 1, 0, 0},
        {1, 1, 1, 1}
    };


    int Path[4][4] = { {0, 0, 0, 0},
        {0, 0, 0, 0},
        {0, 0, 0, 0},
        {0, 0, 0, 0}
    };
    bool a=Findpath(maze,0,0,Path);
   if(a==false)
{
 printf("Solution doesnot Exist\n");
return false;
}
    getch();
}


Labels:

Comments

Post a Comment

Popular posts from this blog

Tricky Questions or Puzzles in C ( Updated for 2026)

Updated for 2026 This article was originally written when C/C++ puzzles were commonly asked in interviews. While such language-specific puzzles are less frequent today, the problem-solving and logical reasoning skills tested here remain highly relevant for modern Software Engineering, Data Engineering, SQL, and system design interviews . Why These Puzzles Still Matter in 2026 Although most Software &   Data Engineering interviews today focus on Programming, SQL, data pipelines, cloud platforms, and system design , interviewers still care deeply about how you think . These puzzles test: Logical reasoning Edge-case handling Understanding of execution flow Ability to reason under pressure The language may change , but the thinking patterns do not . How These Skills Apply to Data Engineering Interviews The same skills tested by C/C++ puzzles appear in modern interviews as: SQL edge cases and NULL handling Data pipeline failure scenarios Incremental vs ...
23 comments
Read more

Program to uncompress a string ie a2b3c4 to aabbbcccc

Below is the program to uncompress a string #include<stdio.h> #include<conio.h> #include<stdlib.h> int main() { char str[100]="a2b3c4d8u7"; for(int i=0;str[i]!='\0';i++) { if(i%2!=0) { for(int j=0;j<atoi(&str[i]);j++) { printf("%c",str[i-1]); } } } getch(); } Want to become a Data Engineer? Check out below blog posts  1.  5 Key Skills Every Data Engineer needs in 2023 2.  How to prepare for Data Engineering Interviews 3.  Top 25 Data Engineer Questions
2 comments
Read more

Programs and Puzzles in technical interviews i faced

I have attended interview of nearly 10 companies in my campus placements and sharing their experiences with you,though i did not got selected in any of the companies but i had great experience facing their interviews and it might help you as well in preparation of interviews.Here are some of the puzzles and programs asked to me in interview in some of the good companies. 1) SAP Labs I attended sap lab online test in my college through campus placements.It had 3 sections,the first one is usual aptitude questions which i would say were little tricky to solve.The second section was Programming test in which you were provided snippet of code and you have to complete the code (See Tricky Code Snippets  ).The code are from different data structures like Binary Tree, AVL Tree etc.Then the third section had questions from Database,OS and Networks.After 2-3 hours we got the result and i was shortlisted for the nest round of interviews scheduled next day.Then the next day we had PPT of t...
4 comments
Read more