Find Us On: Facebook Twitter Rss Feed Blog
Need To Register? Sign Up Login

Maze Recursion C++

luckens-victor
luckens-victor 


I will attach a file explaining the directions for this assignment, if you have any questions feel free to messsage me Attachments Tags
Clarifications

Answers

Maze solver

felo
felo 



see attached for the working program Attachments
MazeSolver.rar (2 K) Download

Preview
<fstream> #include "maze.h" using namespace std; int main() { maze newMaze; cout<<"\nWELCOME TO THE MAZE SOLVER

Preview
cout<<index<< " : " << mazeArray[index] <<endl; mazeArray[index]='v'; // marks current spot as visited (v) //First is the base case of the recursion. are we at the goal ($) if(mazeArray[index] == '$'){return true;} if(mazeArray[index - xDim]== '-' && index<(xDim*(yDim-1))) // checks down for open path and considers maze

Preview
operator << (std::ostream& outs, const maze& source); // overload ostream operator and print out maze // double loop? private: char* mazeArray; //

maze.png (2 K) Download Preview

Screenshots
Screenshot
Purchase Answer

Mr.

felo
felo 



1 Attachments
Screenshots
Purchase Answer