In this project, we will utilize stack and queue to solve graph search problems. Mazes are perfect graphs because mazes can be viewed as being undirected, fully connected graphs.
There are some rooms in a maze, as shown in the figure below.
[login to view URL]
(1) The left side ">" means an entrance (start node); the right side ">" stands for an exit (finish node).
(2) Letters are rooms; "-" stands for walls; "*" means corners; " " shows tunnels.
Program Requirements [30% points]
The three input mazes files ([login to view URL], [login to view URL], and [login to view URL]) are listed on Canvas: Canvas --> Files-->project1_maze
Usually, two graph search algorithms, Depth-First Search (DFS) and Breadth-First Search (BFS), are broadly utilized to solve mazes. You also need to use STACK and Queue.
Your program implements algorithms, and the output files should be *. txt files. For example, if your input file is "[login to view URL]", your output files are "[login to view URL]" and "[login to view URL]"
In output files, your results clearly show a step-by-step travel map.
Demo and Presentation [30% points]
Students need to demo his/her program and results via a recorded video. The professor or TA may independently verify your codes and results.
Project Report [40% points]
A well-written project report. The reports should consist of detailed steps, such as descriptions, screenshots, camera images, etc. Also, the report should have an abstract, introduction, main contexts, conclusion, references, team member contributions, team member list, attached source codes, a recorded video, etc.
12 freelancers are bidding on average $140 for this job
Hy Professional software engineer here and programmer since 8 yrs now can provide effective work in low budget can start right away will make your coding perfect waiting for inbox to start work Thanks
Hi, I'm a competitive programmer and expert in data structures and algorithms. I can your project easily with project report. let's discuss details in chat. Thanks