Just Part 1 and Part 2 they are connected. Objective: The objective of this lab is to gain experience using 2-dimensional arrays, and algorithm development. Also, it will reinforce the concepts of loop structures, random number generation, functions, and text formatting. This goal of this assignment is to simulate a robot negotiating a room. The first version will use a "random walk" algorithm which the "robot" in maze will just randomly wander until an exit is found. The second version will modified the original solution to block off any dead ends that the "robot" may find. The later version should result in shorter path (both time and distance wise) being found through the maze. Review Random Number Generation Review Two Dimensional C++ arrays Read Problem Specification Create and Test a class called mazeSolver. You may find the functions names listed in the specification useful. Use the filenames of amazing_random_walk.cpp and amazing_intelligent.cpp for GITHUB submission. Submit Assignment to GIT under maze solver with containing amazing_random_walk.cpp, amazing_intelligent.cpp, and least three test maze files (all text files). Specification: You will be working extensively with a two dimensional character array in this assignment to simulate a robot navigating a series of rooms to an exit point. The robot at first will just be taught how to randomly walk around the room. The robot then will be given a more intelligent algorithm that allows the robot to avoid travelling in certain areas that the robot has travelled before (dead ends). You may want to review the Wikipedia article on maze solving. First make sure you seed the random number generator in main(). You only need to call srand() once. Just Part 1 and Part 2 they are connected. Objective: The objective of this lab is to gain experience using 2-dimensional arrays, and algorithm development. Also, it will reinforce the concepts of loop structures, random number generation, functions, and text formatting. This goal of this assignment is to simulate a robot negotiating a room. The first version will use a "random walk" algorithm which the "robot" in maze will just randomly wander until an exit is found. The second version will modified the original solution to block off any dead ends that the "robot" may find. The later version should result in shorter path (both time and distance wise) being found through the maze. Review Random Number Generation Review Two Dimensional C++ arrays Read Problem Specification Create and Test a class called mazeSolver. You may find the functions names listed in the specification useful. Use the filenames of amazing_random_walk.cpp and amazing_intelligent.cpp for GITHUB submission. Submit Assignment to GIT under maze solver with containing amazing_random_walk.cpp, amazing_intelligent.cpp, and least three test maze files (all text files). Specification: You will be working extensively with a two dimensional character array in this assignment to simulate a robot navigating a series of rooms to an exit point. The robot at first will just be taught how to randomly walk around the room. The robot then will be given a more intelligent algorithm that allows the robot to avoid travelling in certain areas that the robot has travelled before (dead ends). You may want to review the Wikipedia article on maze solving. First make sure you seed the random number generator in main(). You only need to call srand() once
