Maze Solver in C

-

               It is a classical project. It is implemented by the use of graph traversal algorithm. It mainly finds the path from starting point to the end point.

Here, maze is represented as a 2D matrix. Walls are marked as 1 and paths are marked as 0.

C implementation:

  • ·       It starts from including header file.
  • ·       First, the rows and columns are defined as 5.
  • ·       Maze is initialized with values.
  • ·       Visited value is created.
  • ·       solveItMaze() function is used to solve the maze.
  • ·       This function is used to visit all the rows and columns to find the path. The path starts from starting point to end point.
  • ·       Main() function checks for path is not equal to 0,0.
  • ·       Finally,the visited path is printed.

C Code:

#include <stdio.h>

#define M_ROWS 5

#define M_COLS 5

int maze[M_ROWS][M_COLS] = {

    {0,1,0,0,0},

    {0,1,0,1,0},

    {0,0,0,1,0},

    {1,1,0,0,0},

    {0,0,0,1,0}

};

int visited[M_ROWS][M_COLS];

int solveItMaze(int x, int y) {

    if (x == M_ROWS-1 && y == M_COLS-1) {

        printf("Exit found at (%d,%d)\n", x, y);

        return 1;

    }

    if (x < 0 || y < 0 || x >= M_ROWS || y >= M_COLS || maze[x][y] == 1 || visited[x][y])

        return 0;

    visited[x][y] = 1;

    printf("Visiting (%d,%d)\n", x, y);

    // Try all directions

    if (solveItMaze(x+1, y) || solveItMaze(x-1, y) || solveItMaze(x, y+1) || solveItMaze(x, y-1))

        return 1;

    return 0;

}

int main() {

    if (!solveItMaze(0,0))

        printf("No path found!\n");

    return 0;

}

Output:

Visiting (0,0)

Visiting (1,0)

Visiting (2,0)

Visiting (2,1)

Visiting (2,2)

Visiting (3,2)

Visiting (4,2)

Visiting (4,1)

Visiting (4,0)

Visiting (3,3)

Visiting (3,4)

Exit found at (4,4)

Thus, the C program to Maze solver was implemented successfully. Hope, this code is useful to you. Keep Coding!!!

Comments

Post a Comment

Popular posts from this blog

How to create a XML DTD for displaying student details

-
Image
XML  is    e X tensible M arkup L anguage which is used to create used defined tags.  It has Elements  ( <STUDENT>) Attributes (<STUDENT id="21it21">) To create a XML file, create three files 1 ->  XML file (used to declare the user defined tags) 2 ->  DTD file (used to define the user defined tags) 3 ->  HTML file(used to display the xml file as web page) create these three files using any editor like notepad.  Student.Xml <?xml version="1.0"?> <!DOCTYPE STUDENTS SYSTEM "E:\XML1\STUDENT.dtd"> <STUDENTS>  <STUDENT>  <STUDENTDATA>     <NAME> SUTHA </NAME>     <ID>  2007IT51 </ID>     <AGE> 20 </AGE>     <ADDRESS> 12, SATHY ROAD , GOBI </ADDRESS>   </STUDENTDATA> </STUDENT> </STUDENTS> Student.dtd <?xml version="1.0"?> <!ELEMENT STU...
Read more

Employee record management in C

-
               Let us create a employee record management in C. A employee record has name, id and salary. The operations are adding the details, search an employee, delete a record and display the employee records. Program implementation: #include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 100 struct Employee {     int e_id;     char e_name[50];     float e_salary; }; struct Employee emp[MAX]; int count = 0; void addEmployee() {     printf("\nEnter the Employee id: ");     scanf("%d", &emp[count].e_id);     printf("Enter the Employee Name: ");     scanf(" %[^\n]", emp[count].e_name);     printf("Enter the salary: ");     scanf("%f", &emp[count].e_salary);     count++;     printf("Employee details ar...
Read more

Callables in Multithreading

-
              Callables are like a function and passed to a thread . It is executed simultaneously with the thread. Let us categorize the callables as follows. Categories: ·        Function ·        Function Object ·        Lambda Expression ·        Non- static or static Member Function Function:               It creates the function to be called with thread. C++ Program: #include < bits/stdc++.h > using namespace std ; void samp(int no) {     cout <<"The number is:"<< no; } int main() {     int n;     cout<<"Enter the number "<<endl;     cin>>n;     thread t(samp, n);     // Wait for thread to finish ...
Read more