Write a C++ program that read a text file as a Maze, and output its path. You ca

Question

Write a C++ program that read a text file as a Maze, and output its path. You can move Up, Down, Left and Right, and you may move only one cell at a time.

use a 2-D array to store the types of the cells, and use it when deciding whether to take the next cell.

(solve it with stack or recursion)

Two tasks, depends on the input from the user on the command line

1. find one path

2.find all paths

The first two numbers represent the # of rows and columns

A ?-? represents a wall, ?.? represents a cell that is part of a path

This is the solution for the maze

Explanation / Answer

#include <iostream>

#include <time.h>

#include <fstream>

using namespace std;

class Maze

{

public:

   Maze();

   ~Maze();

   // Methods

   void ReadMaze(string name);

   void WriteMaze(string name);

   void PrintMaze();

   bool SearchMaze(int r, int c);

   void GetMaze(int r, int c, char &value);

   void SetMaze(int r, int c, char value);

   void GetStart(int &r, int &c);

   void SetStart(int r, int c);

   void GetEnd(int &r, int &c);

   void SetEnd(int r, int c);

private:

   int num_rows, num_cols;

   int start_row, start_col;

   int end_row, end_col;

   char maze[100][100];

};

Maze::Maze()

{

   num_rows = 0;

   num_cols = 0;

   start_row = 0;

   start_col = 0;

   end_row = 0;

   end_col = 0;

}

Maze::~Maze()

{

}

void Maze::ReadMaze(string name)

{

   // Read maze.txt header

   ifstream din;

   din.open(name.c_str());

   din >> num_rows >> num_cols;

   din >> start_row >> start_col;

   din >> end_row >> end_col;

   // Read maze.txt body

   string line;

   getline(din, line);

   for (int r = 0; r < num_rows; r++)

   {

      getline(din, line);

      for (int c = 0; c < num_cols; c++)

                if (c < int(line.length()))

                    maze[r][c] = line[c];

   }

   din.close();

}

void Maze::WriteMaze(string name)

{

   // Write maze.txt header

   ofstream dout;

   dout.open(name.c_str());

   dout << num_rows << " " << num_cols << endl;

   dout << start_row << " " << start_col << endl;

   dout << end_row << " " << end_col << endl;

   // Write maze.txt body

   for (int r = 0; r < num_rows; r++)

   {

      for (int c = 0; c < num_cols; c++)

                dout << maze[r][c];

      dout << endl;

   }

   dout.close();

}

void Maze::PrintMaze()

{

   // Print maze

   for (int r = 0; r < num_rows; r++)

   {

      for (int c = 0; c < num_cols; c++)

                cout << maze[r][c];

      cout << endl;

   }

}

bool Maze::SearchMaze(int r, int c)

{

   // Terminating conditions

   if ((r < 0) || (r >= num_rows) || (c < 0) || (c >= num_cols))

      return false;

   else if (maze[r][c] != ' ')

      return false;

   // Recursive conditions

   maze[r][c] = '-';

   if (((r == end_row) && (c == end_col)) ||

       SearchMaze(r + 1, c) || SearchMaze(r - 1, c) ||

       SearchMaze(r, c + 1) || SearchMaze(r, c - 1))

   {

      cout << r << " " << c << endl;

      maze[r][c] = '.';

      return true;

   }

   else

      return false;

}

void Maze::GetStart(int &r, int &c)

{

   r = start_row;

   c = start_col;

}

void Maze::SetStart(int r, int c)

{

   start_row = r;

   start_col = c;

}

void Maze::GetEnd(int &r, int &c)

{

   r = end_row;

   c = end_col;

}

void Maze::SetEnd(int r, int c)

{

   end_row = r;

   end_col = c;

}

int main()

{

   Maze m;

   int r, c;

   m.ReadMaze("maze.txt");

   m.PrintMaze();

   m.GetStart(r, c);

   m.SearchMaze(r, c);

   m.PrintMaze();

   m.WriteMaze("maze.out");

}

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.