Synopsis

• Read the lab writeup on Instructure Canvas.
• There are four parts to this lab: Makefile, Mazemake, Mazesolve, Mazeimage. For COSC 302 students, Mazeimage is optional and may be submitted for extra credit. For COSC 307 students, all parts are required for full credit.

Side files

I have created a few extra files specifically for this lab assignment. They may help you, or they may not.

• array_memory.h - Helper header file for allocating and freeing 2D and 3D generic-typed arrays in C.
• mazemake_tips.pdf - Sketch of Mazemake, how to approach it, and how to visualise the wall[N][2] variable used.
• mazesolve_tips.pdf - LaTeX document on how to think about DFS theoretically and practically. Features pseudocode for an ideal recursive and iterative implementation.

You can grab all of these here: http://file.claranguyen.me/index.php?path=/utk/cs302/fa19/lab6

The following simulator was written specifically for this assignment to demonstrate how Mazesolve's DFS method should work. You are able to view the path in 2 ways... instantly, or procedurally. "Procedurally" will show each step of DFS to give you an idea of how to traverse the graph recursively.

Along with that, since it's a visual simulation, it also shows what Mazeshow should show. You are also able to download mazes and paths generated by it, and they are compatible with the solution executables. These options don't need explaining, though the "seed" is exclusive to this simulator. For your program, do srand(time(NULL)); when making your mazes. Have at it.


Notice some restrictions? Both width and height have a minimum of 2 and a maximum of 20. This is mainly so this webpage wouldn't get its layout messed up. If you want to experience the full simulator without restrictions, click here.

We will be following these guidelines.

Submission

• makefile
• Mazemake.cpp
• Mazesolve.cpp
• Mazeimage.cpp