CS 160, Spring 2015
Programming Assignment P6
Maze Program

Programming due Monday, Mar. 9 at 6:00pm; late deadline Mar. 9 at 11:59pm.

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

Description

Instructions

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

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

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

// Commands to move Chihiro
public void moveRight();
public void moveLeft();
public void moveDown();
public void moveUp();

// Returns true when Chihiro finds Haku, false otherwise
public boolean isDone()

Algorithm

• The mazes are square, but can be of any size.
• Chihiro can start anywhere, as specified by the maze.
• Haku can be anywhere, as specified by the maze.
• If you follow the rules, Chihiro will never encounter Yubaba.
• Row and column numbers are zero based, so the first row and column is index 0.
• Here is the exact algorithm for finding Haku, each step requires a loop:
  1. If Chihiro is not in the leftmost column, move her left until she is.
  2. If Chihiro is not in the bottom row, move her down until she is.
  3. Move Chihiro from the bottom left to the bottom right of the maze.
  4. Move Chihiro from the bottom right to the top right of the maze.
  5. Move Chihiro diagonally from top right to bottom left.
  6. When moving along the diagonal, move left then down, and repeat.
• Each time you move you must call the maze.isDone() method.
• If maze.isDone() returns true, your program must exit.
• If you go outside the maze, the maze will print an error and exit.
• If you go run into Yubaba, the maze will print an error and exit.
• When Chihiro finds Haku, you must immediately break out of all loops, and exit the program.
• There are mazes that cannot be solved using the algorithm, but we will not test your program with any of them.

Maze name: maze.txt
Maze width: 6
Maze height: 6
Moved to row 2, column 3
Moved to row 2, column 2
Moved to row 2, column 1
Moved to row 2, column 0

Testing

6
--Y---
-Y----
----C-
----Y-
-H-Y--
------

Specifications

• Chihiro must follow the exact route specified.
• Chihiro can only move to a square adjacent to the current position.
• 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.5 or 1.6 or 1.7.
• 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 program compiles. (10 points)
  • test1: Chihiro correctly solves Maze1.txt (10 points)
  • test2: Chihiro correctly solves Maze2.txt (10 points)
  • test3: Chihiro correctly solves Maze3.txt (10 points)
  • test4: Chihiro correctly solves Maze4.txt (10 points)
  • test5: Chihiro correctly solves Maze5.txt (10 points)
• Preliminary tests use mazes of different sizes, so do not hard code width and height.
• Final Tests
  • test6: We will test with a straightforward maze, not provided to you. (10 points)
  • test7: We will test with a more complex maze, not provided to you. (10 points)
  • test8: We will test with a small but devious maze, not provided to you. (10 points)
  • test9: We will test with a large and devious maze, not provided to you. (10 points)
• Final grading includes the preliminary tests.