Scribd Logo
Upload

Welcome to Scribd!

  • Dsa Lab Miid Za

    Uploaded by

    Zain Abbasi
    12 views5 pages
    This C++ code defines a maze with walls, a starting point, and an exit. It initializes the maze by filling it with walls on the edges and free space elsewhere. It then prints the maze to the console and uses a loop to move a character through the maze, updating its position if the space in the given direction is free. It clears the console and reprints the maze at each step until the character reaches the exit point.

    Original Description:

    data structure

    Original Title

    DSA LAB MIID ZA

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C++ code defines a maze with walls, a starting point, and an exit. It initializes the maze by filling it with walls on the edges and free space elsewhere. It then prints the maze to the console and uses a loop to move a character through the maze, updating its position if the space in the given direction is free. It clears the console and reprints the maze at each step until the character reaches the exit point.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views5 pages

    Dsa Lab Miid Za

    Uploaded by

    Zain Abbasi
    This C++ code defines a maze with walls, a starting point, and an exit. It initializes the maze by filling it with walls on the edges and free space elsewhere. It then prints the maze to the console and uses a loop to move a character through the maze, updating its position if the space in the given direction is free. It clears the console and reprints the maze at each step until the character reaches the exit point.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 5

    Name: Raja Farhan Ali Janjua

    Class: Sp21-bse-028
    Subject: DSA LAB
    CODE
    #include <iostream>
    #include <windows.h>
    const int MazeWidth = 30;
    const int MazeHeight = 20;
    const char MazeExit = '$';
    const char Wall = '#';
    const char Free = ' ';
    const unsigned char SomeDude = 254;
    COORD MazeExitCoords;
    COORD StartingPoint;

    using namespace std;


    char Maze [MazeHeight][MazeWidth];

    void FillDaMaze(){

    MazeExitCoords.X = MazeWidth - 20;


    MazeExitCoords.Y = 2;
    StartingPoint.X = 3;
    StartingPoint.Y = MazeHeight - 3;

    for(int i = 0; i < MazeHeight; i++){

    for(int ii = 0; ii < MazeWidth; ii++){


    if(i == 0 || i == MazeHeight - 1 || ii == 0 || ii == MazeWidth - 1){
    Maze[i][ii] = Wall;
    }
    else{
    Maze[i][ii] = Free;
    }

    if(i == MazeExitCoords.Y && ii == MazeExitCoords.X){


    Maze[i][ii] = MazeExit;
    }
    else if(i == StartingPoint.Y && ii == StartingPoint.X){
    Maze[i][ii] = SomeDude;
    }
    }
    }
    }
    void PrintDaMaze(int color){
    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),color);

    for(int i = 0; i < MazeHeight; i++){

    for(int ii = 0; ii < MazeWidth;ii++){

    cout << Maze[i][ii];


    }
    cout << endl;
    }
    }
    void FindYourWayThroughTheMaze(){

    if(Maze[StartingPoint.Y + 1][StartingPoint.X] != Wall && Maze[StartingPoint.Y + 1]


    [StartingPoint.X ] != SomeDude){
    StartingPoint.Y++;

    }
    else if(Maze[StartingPoint.Y][StartingPoint.X + 1] != Wall && Maze[StartingPoint.Y]
    [StartingPoint.X + 1] != SomeDude){
    StartingPoint.X++;

    }
    else if(Maze[StartingPoint.Y - 1][StartingPoint.X] != Wall && Maze[StartingPoint.Y - 1]
    [StartingPoint.X ] != SomeDude){
    StartingPoint.Y--;

    }
    else if(Maze[StartingPoint.Y][StartingPoint.X - 1] != Wall && Maze[StartingPoint.Y]
    [StartingPoint.X - 1] != SomeDude){
    StartingPoint.X--;

    Maze[StartingPoint.Y][StartingPoint.X] = SomeDude;

    }
    int main(){

    FillDaMaze();
    PrintDaMaze(10);
    while(StartingPoint.X != MazeExitCoords.X || StartingPoint.Y != MazeExitCoords.Y){
    FindYourWayThroughTheMaze();
    system("CLS");
    PrintDaMaze(10);
    Sleep(50);
    }

    You might also like