The case study at the end of Chapter 7 describes a recursive

The case study at the end of Chapter 7 describes a recursive solution to determining whether or not a maze’s exit can be reached given some start cell. In this programming assignment you will adjust the implementation in a number of ways.The files are pasted below.

The files you should complete the implementation of are MazeDr.cpp, Maze.h, and Maze.cpp. An example test file is provided, maze1.

1. Describe the initial implementation. This can go in your details document

(at least two paragraphs).

2. Allow the maximum size of the input maze to be at least 50 × 50. Describe

in your details document what you had to change to achieve this.

3. Adjust the program to allow diagonal moves. Again, describe the changes

in your details document.

4. Return the path from the start cell to the exit by visually displaying the

nodes tested and where the nodes came from. You can do this by tracking

the parent cell of each node and displaying a different character than the

ones already defined. After returning whether or not a path exists the

maze with the path should be output.

5. Adjust the driver program to allow the user to specify whether or not a new

cell is being tested in the current maze or to load a new maze. This should

make testing easier for the user.

6. Create 5 different mazes with all of the sizes containing more cells than a

25 × 25 grid. Run your program on 5 different start/exit cells for each

maze. Remember your program should not only output whether or not a

path exists but also should visually display the path. Your input and output

should be submitted to receive full credit.

7. Discussion items to be included in your document: 1) Can you think of an

algorithm that would find a path to the exit better (it does not need to be

recursive)? Describe the algorithm. 2) What happens to environments with

multiple exits? 3) Does the algorithm that you coded return good paths? 4)

How would you change your program to only allow moves up and to the

right?

8. Submit a specification details document that describes the changes to the

program you made and implementation of your program.

//MazeDr.cpp

//Maze.cpp

//Maze.h

Solution

//Maze.h