Free

60.1K

Verified Solution

Link Copied!

********JAVA************

This program deals with graphs and path-finding withinthem.
write a program which allows the user to enter multiple levels of atext, consisting of a
'start', an 'exit', 'walls', and 'floors'. The letter S representsthe start. E is the exit. O (the letter 'oh') represents a
'floor' (meaning a path you can follow). X is a wall (meaning ablock you cannot pass).
The program will accept Standard Input (System.in), It is up to youwhether you wish to use an adjacency matrix or adjacency lists(linked or array-based).
Ideally, the program will allow the user to find the 'fastest' paththrough the maze. In this context, 'fastest'
means the fewest number of steps possible to get from the start tothe exit, without crossing a wall. Note: You
may only move North, South, East, West, Up, or Down (diagonaltravel is not allowed).
If no valid path exists, the program should say so. You may assume'sane' input, and that a start and exit are
present (though there might not be a path connecting them). Themaps do not 'wrap' (i.e. you can't exit the left
edge to appear on the right edge), and you may not assume that afloor will have a boundary of walls.
Specifically, the input will be as follows:
An integer for the width of the map (W)
An integer for the height (length) of the map (H)
An integer for the depth (number of layers) of the map (D)
D×H lines of W characters (from {X,O,S,E}), terminated withnewlines
For D layers, first the (H) lines of the top layer will be entered,then the lines of the second-highest, etc.
In place of any line of W characters, it is legal to include anentirely blank line (as such, any line will have W
characters followed by a \n, or consist solely of a \n. the codemust be able to ignore such blank lines, but
may never rely on their presence; an input might not have any blanklines at all).

output should look like this:

Enter width: 8
Enter height: 5
Enter depth: 1
Enter maze below. Only rows of width 8 will be accepted.
XXXOOOOX
OXXXOXOE
OXXOOXXO
OSXOXXXO
XOOOXOOO
1. Solve suboptimally
2. Estimate optimal solution cost
3. Solve optimally
4. Enter new puzzle
5. Quit
:> 1
Not implemented. Use optimal instead.
1. Solve suboptimally
2. Estimate optimal solution cost
3. Solve optimally
4. Enter new puzzle
5. Quit
:> 3
Finding Solution...
Optimal Path Cost: 12
Optimal Path:
S E E N N E N N E E S E