The algorithm keeps moving down paths until it hits a

Info icon This preview shows pages 45–49. Sign up to view the full content.

View Full Document Right Arrow Icon
The algorithm keeps  moving down paths  until it hits a  dead end .   Once it hits a dead end, the function returns until there is an unvisited adjacent  square and tries another path.
Image of page 45

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Solving a Maze void solve(int sx, int sy) { m[sy][sx] = ‘#’; // drop crumb if (sx == dx && sy == dy) solveable = true; // done! if (m[sy-1][sx] == ' ‘) solve(sx,sy-1); if (m[sy+1][sx] == ' ‘) solve(sx,sy+1); if (m[sy][sx-1] == ' ‘) solve(sx-1,sy); if (m[sy][sx+1] == ' ‘) solve(sx+1,sy); } bool solvable; // globals int dx, dy; char maze[11][11] = { "**********", "* *", "* * * ** *", "*** * * *", "* * ** * *", "* *** *", "* * * *", "* ***** *", "* * *", "**********“ }; main() { solvable = false ; dx = dy = 10; solve( 1 , 1 ); if (solvable == true) cout << “possible!” };   Finish # Start 1 1 void solve(int sx, int sy) { m[sy][sx] = ‘#’; // drop crumb if (sx == dx && sy == dy) solveable = true; // done! if (m[sy-1][sx] == ' ‘) solve(sx,sy-1); if (m[sy+1][sx] == ' ‘) solve(sx,sy+1); if (m[sy][sx-1] == ' ‘) solve(sx-1,sy); if (m[sy][sx+1] == ' ‘) solve(sx+1,sy); } 2 1 # 1 == 10 && 1 == 10?? // dead end! 1 == 10 && 2 == 10??
Image of page 46
Solving a Maze void solve(int sx, int sy) { m[sy][sx] = ‘#’; // drop crumb if (sx == dx && sy == dy) solveable = true; // done! if (m[sy-1][sx] == ' ‘) solve(sx,sy-1); if (m[sy+1][sx] == ' ‘) solve(sx,sy+1); if (m[sy][sx-1] == ' ‘) solve(sx-1,sy); if (m[sy][sx+1] == ' ‘) solve(sx+1,sy); } bool solvable; // globals int dx, dy; char maze[11][11] = { "**********", "* *", "* * * ** *", "*** * * *", "* * ** * *", "* *** *", "* * * *", "* ***** *", "* * *", "**********“ }; main() { solvable = false ; dx = dy = 10; solve( 1 , 1 ); if (solvable == true) cout << “possible!” };   Finish # Start # 1 1 void solve(int sx, int sy) { m[sy][sx] = ‘#’; // drop crumb if (sx == dx && sy == dy) solveable = true; // done! if (m[sy-1][sx] == ' ‘) solve(sx,sy-1); if (m[sy+1][sx] == ' ‘) solve(sx,sy+1); if (m[sy][sx-1] == ' ‘) solve(sx-1,sy); if (m[sy][sx+1] == ' ‘) solve(sx+1,sy); } 1 2 # 2 == 10 && 1 == 10?? void solve(int sx, int sy) { m[sy][sx] = ‘#’; // drop crumb if (sx == dx && sy == dy) solveable = true; // done! if (m[sy-1][sx] == ' ‘) solve(sx,sy-1); if (m[sy+1][sx] == ' ‘) solve(sx,sy+1); if (m[sy][sx-1] == ' ‘) solve(sx-1,sy); if (m[sy][sx+1] == ' ‘) solve(sx+1,sy); } 1 3 # 3 == 10 && 1 == 10?? void solve(int sx, int sy) { m[sy][sx] = ‘#’; // drop crumb if (sx == dx && sy == dy) solveable = true; // done! if (m[sy-1][sx] == ' ‘) solve(sx,sy-1); if (m[sy+1][sx] == ' ‘) solve(sx,sy+1); if (m[sy][sx-1] == ' ‘) solve(sx-1,sy); if (m[sy][sx+1] == ' ‘) solve(sx+1,sy); } 2 3 # And on it goes…
Image of page 47

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Solving a Maze void solve(int sx, int sy) { m[sy][sx] = ‘#’; // drop crumb if (sx == dx && sy == dy) solveable = true; // done! if (m[sy-1][sx] == ' ‘) solve(sx,sy-1); if (m[sy+1][sx] == ' ‘) solve(sx,sy+1); if (m[sy][sx-1] == ' ‘) solve(sx-1,sy); if (m[sy][sx+1] == ' ‘) solve(sx+1,sy); } bool solvable; // globals int dx, dy; char maze[11][11] = { "**********", "* *", "* * * ** *", "*** * * *", "* * ** * *", "* *** *", "* * * *", "* ***** *", "* * *", "**********“ }; main() { solvable = false ; dx = dy = 10; solve( 1 , 1 ); if (solvable == true) cout << “possible!” };   Finish # Start # 1 1 void solve(int sx, int sy) { m[sy][sx] = ‘#’; // drop crumb if (sx == dx && sy == dy) solveable = true; // done! if (m[sy-1][sx] == ' ‘) solve(sx,sy-1); if (m[sy+1][sx] == ' ‘) solve(sx,sy+1); if (m[sy][sx-1] == ' ‘) solve(sx-1,sy); if (m[sy][sx+1] == ' ‘) solve(sx+1,sy); } # 2 == 10 && 1 == 10?? void solve(int sx, int sy) { m[sy][sx] = ‘#’; // drop crumb if (sx == dx && sy == dy) solveable = true; // done! if (m[sy-1][sx] == ' ‘) solve(sx,sy-1); if (m[sy+1][sx] == ' ‘) solve(sx,sy+1); if (m[sy][sx-1] == ' ‘) solve(sx-1,sy); if (m[sy][sx+1] == ' ‘) solve(sx+1,sy); } # 3 == 10 && 1 == 10??
Image of page 48
Image of page 49
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern