package edu.luc.cs.cs271.mazesolver; import java.util.ArrayList; import java.util.Scanner; public class Main { public static void main(final String[] args) { // create scanner for data input final var input = new Scanner(System.in); // TODO read row and column for the starting point final var startRow = -1; final var startCol = -1; // TODO read maze
package edu.luc.cs.cs271.mazesolver;
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(final String[] args) {
// create scanner for data input
final var input = new Scanner(System.in);
// TODO read row and column for the starting point
final var startRow = -1;
final var startCol = -1;
// TODO read maze data one row (line) at a time into rawData
final var rawData = new ArrayList<String>();
// attempt to solve the maze and print the result
final var maze = new Maze(rawData);
final var result = maze.solve(startRow, startCol);
maze.print(System.out);
System.out.println();
System.out.println(result ? "We're so out of here!" : "Bummer, we're stuck...");
}
}
![2. Complete the TODO items in the various sources until the program behaves as required. Recommended order:
o constructor
o print
o read (in Main)
o solve
o tests
This is a short but complex project. You are encouraged to get started early and use the available supports.
3. Create at least one additional maze of size 10x10 or larger and with at least two exits.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbda60386-cf75-4b0b-a556-f8e365521ce5%2F600c6112-8358-4f42-bd61-91baec9cac08%2Fxn2weo_processed.png&w=3840&q=75)
![Objectives
An understanding of the following concepts and techniques:
• two-dimensional arrays
using stacks for depth-first search
parametric thinking
• object-oriented design
Description
In this lab, you will have the opportunity to develop a maze solver using stack-based backtracking. The maze solver
behaves as follows:
1. It first reads from the standard input the row and column of the starting point within the maze. (The maze does
not need to be square, but all of its rows must have the same width.)
2. It then reads from the standard input the maze data in the form of same-length strings representing rows in the
maze.
represents a wall
o . represents an empty space we can visit
3. It then attempts to find a way out of the maze from the starting point.
4. Finally, it prints the maze showing
o the starting point as a 0 (zero)
o unvisited cells as . (dot)
o visited cells (including those leading out) as + (plus)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbda60386-cf75-4b0b-a556-f8e365521ce5%2F600c6112-8358-4f42-bd61-91baec9cac08%2F3xyttc_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)