Reverse Puzzle

Create a puzzle in which the user is presented with an array of length n containing the values 1..n in random order. The user repeatedly chooses one of three available moves with the goal of putting the array in order. The moves are described below.

Moves:

1. Reverse Left End: Reverse the order of the values in the array from index 0 to index n-2.
2. Reverse Right End: Reverse the order of the values in the array from index 1 to index n-1.
3. Reverse Center: Reverse the order of the values in the array from index 1 to index n-2.

Part a. Draw a design diagram similar to the PrintCalendar case study from the text's slides. You can find the version we used in class at:http://cs.gettysburg.edu/~cpresser/cs111/files/Ch6_CalendarDesign.pdf. Break the problem down into simple sub-problems. Consider decomposing into operations such as printing the array, checking if the puzzle is solved, reversing a portion of the array, among others. You should break it down into at least 4 sub-problems. Submit the diagram as a pdf.

Part b. Write a program to play the game using techniques we have learned in class.

• Write methods determined by your decomposition from part a. Make sure your methods are short and easy to write. You may decide to break them down further while writing.
• You should have at least 4 methods other than main implementing your sub-problems from part a.
• Prompt the user for the size of the array you will use, and repeatedly prompt for a move.
• Perform appropriate error checking on the user input so an incorrect input won't end the program with an error.
• To initially jumble the puzzle, create the array in order 1..n, then randomly swap pairs of locations in the array. Use Math.random() (not java.util.Random) for randomization.
• Note when n=6 or n=10, half of the puzzles are unsolvable.
• Selecting quit should end your outer most loop normally through its condition. Do no use return, break, or System.exit().
• Call the program ReversePuzzle.java.

Sample Execution 1 (user input in bold)

What size array (integer >= 3)? 4
    3    1    2    4
-------------------------

(Q) quit	(A) reverse left end	(D) reverse right end	(S) reverse center.
> a
    2    1    3    4
-------------------------

(Q) quit	(A) reverse left end	(D) reverse right end	(S) reverse center.
> s
    2    3    1    4
-------------------------

(Q) quit	(A) reverse left end	(D) reverse right end	(S) reverse center.
> a
    1    3    2    4
-------------------------

(Q) quit	(A) reverse left end	(D) reverse right end	(S) reverse center.
> s
    1    2    3    4
-------------------------
You solved it in 4 moves.

Sample Execution 2 (user input in bold)

What size array (integer >= 3)? 5
    4    1    2    5    3
------------------------------

(Q) quit	(A) reverse left end	(D) reverse right end	(S) reverse center.
> s
    4    5    2    1    3
------------------------------

(Q) quit	(A) reverse left end	(D) reverse right end	(S) reverse center.
> a
    1    2    5    4    3
------------------------------

(Q) quit	(A) reverse left end	(D) reverse right end	(S) reverse center.
> s
    1    4    5    2    3
------------------------------

(Q) quit	(A) reverse left end	(D) reverse right end	(S) reverse center.
> d
    1    3    2    5    4
------------------------------

(Q) quit	(A) reverse left end	(D) reverse right end	(S) reverse center.
> s
    1    5    2    3    4
------------------------------

(Q) quit	(A) reverse left end	(D) reverse right end	(S) reverse center.
> d
    1    4    3    2    5
------------------------------

(Q) quit	(A) reverse left end	(D) reverse right end	(S) reverse center.
> s
    1    2    3    4    5
------------------------------
You solved it in 7 moves.