CS 163/164, Summer 2018

Programming Assignment - P6

Maze Program

Due Monday, Jul. 2nd at 6:00 pm

Late Tuesday, Jul. 3rd at 8:00 am

Objectives of this Assignment

1. Instantiate a Maze object and call its methods,
2. see your code controlling a graphical user interface, and
3. use control loops to manage movement in the Maze.

Description

public class P6 {

    // Class variables
    public static Maze maze;
    public static int mazeWidth;
    public static int mazeHeight;

    public static void main(String[] args) {

        // Create maze
        String fileName = args[0];
        System.err.println("Maze name: " + fileName);

        // Get dimensions
        maze = new Maze(fileName);
        mazeWidth = maze.getWidth();
        mazeHeight = maze.getHeight();
        System.err.println("Maze width: " + mazeWidth);
        System.err.println("Maze height: " + mazeHeight);

        // Add code to move around maze
    }
}   

1. Modify the run configuration to pass Maze1.txt to the program.
2. Test your program by calling maze.moveRight() to make the student move right one square.
3. Exercise 1: The maze object has similar methods to move down, left, and up, try calling each of them.
4. Exercise 2: Try writing a for or while loop to move Firefly from left to right across the top row.
5. Exercise 3: Run Firefly around the outside of the Maze, in a clockwise direction.
6. Exercise 4: Run Maze5.txt and see what happens when you run into the Reavers.
   Note: In order to detect the Reavers, you must check the return value from the move methods.

Instructions

// Constructor, parameter is name of maze file
public Maze(String fileName);

// Get width and height of maze
public int getWidth();
public int getHeight();

// Get location of Firefly
public int getColumn();
public int getRow();

// Commands to move Firefly
public boolean moveRight();
public boolean moveLeft();
public boolean moveDown();
public boolean moveUp();

Algorithm

• The mazes can be of any size.
• Firefly always starts in the top left corner.
• Mal can be anywhere, as specified by the maze file.
• Reavers can be anywhere, as specified by the maze file.
• If you follow the rules, Firefly will never meet the Reavers, and will find Mal.
• Row and column numbers are zero based, so the first row and column is index 0.
• Here is the exact algorithm for finding Mal:
1. On even rows, Firefly moves from left to right.
2. On odd rows, Firefly moves from right to left.
3. When Firefly reaches the right side on an even row, it moves down.
4. When Firefly reaches the left side on an odd row, it moves down.
5. When Firefly successfully moves, the Maze move methods return true.
6. When Firefly would run into the Reavers, the Maze move methods return false.
7. When the move method returns false, you must pull a "Crazy Ivan" to make Firefly evade the Reavers.
8. "Crazy Ivan" when moving right means move down, right, right, then up.
9. "Crasy Ivan" when moving left means move down, left, left, then up.
10. Hint: You can use an outer loop to run through all rows.
11. Hint: You can use an inner loop to move from left to right.
12. Hint: You can use a separate inner loop to move from right to left.
13. Hint: You can decide between the loops by checking the row modulo 2.
14. Hint: Always move down after completing a loop.
• If Firefly goes outside the maze, the maze will print an error and exit.
• Firefly cannot run into the Reavers, the maze will not allow it.
• When Firefly finds Mal, the maze will print congratulations and exit.
• There are mazes that cannot be solved using the algorithm, but we will not test your program with any of them.

Maze name: Maze5.txt
Maze width: 8
Maze height: 5
Moved to row 0, column 1
Moved to row 0, column 2
Moved to row 1, column 2
Moved to row 1, column 3
Moved to row 1, column 4
Moved to row 0, column 4
Moved to row 0, column 5
Moved to row 0, column 6
Moved to row 0, column 7
Firefly found Mal, congratulations!

Testing

5
6
F----M
--R---
----R-
-R----
---R--

Specifications

• Firefly must follow the exact route specified.
• Work on your own, as always.
• The name of the source code file must be exactly P6.java.
• Name the file exactly - upper and lower case matters!
• Assignments should be implemented using Eclipse.
• Assignments should be implemented using Java 1.8.
• Make sure your code runs on machines in the COMCS 120 lab.
• Submit your program to the Checkin tab as you were shown in the recitation.
• Read the syllabus for the late policy.
• We will be checking programs for plagiarism, so please don't copy from anyone else.

Grading Criteria

• 100 points for perfect submission.
• 0 points for no submission, will not compile, submitted class file, etc.
• Preliminary Tests:
  • compileTest: checks that P6.java program compiles with Maze.java. (0 points)
  • test1: Firefly correctly solves Maze1.txt (10 points)
  • test2: Firefly correctly solves Maze2.txt (10 points)
  • test3: Firefly correctly solves Maze3.txt (10 points)
  • test4: Firefly correctly solves Maze4.txt (10 points)
  • test5: Firefly correctly solves Maze5.txt (10 points)
  • test6: Firefly correctly solves Maze6.txt (10 points)
• Preliminary tests use mazes of different sizes, so do not hard code width and height.
• Final Tests:
  • HardMaze: We will test with a large and devious maze called HardMaze.txt, which is provided to you! (40 points)
• Final grading includes the preliminary tests.

---