2-person teams, one submission in Blackboard per team
Design due in Blackboard Friday, midnight of week 12 (November 12, 11:59 PM)
Code (and resubmission of design for re-grading) due in Blackboard Friday, midnight of final's week (December 10, noon)
Objectives:
Design classes for an object-oriented application.
Code classes for an object-oriented application.
Requirements Document for "Elimination" - Elimination is a one-player game. The board consists of a set of 12 tiles, numbered 1 through 12. The player rolls a pair of dice and marks tiles as removed based on the numbers shown on the dice. For each roll, the player can either “mark removed” the two tiles corresponding to the numbers shown on each die or a single tile corresponding to the sum of the numbers on each die. If the player rolls doubles (the same number on both die), the player can “mark removed” only the tile corresponding to the sum of the numbers on each die. Play continues until the player cannot make a legal move after rolling or all the tiles have been “mark removed”. The sum of the remaining tiles is the player's score. The goal is to have a low score.
In addition to playing the game, your application should keep track of the best (lowest) score of all plays during a single run. Here is a sample run of the application:
Lowest Score = 78
1 2 3 4 5 6 7 8 9 10 11 12
. . . . . . . . . . . .
Dice roll: 4 3
What is your move (V=values, S=sum, Q=quit)? V
1 2 3 4 5 6 7 8 9 10 11 12
. . X X . . . . . . . .
Dice roll: 2 5
What is your move (V=values, S=sum, Q=quit)? V
1 2 3 4 5 6 7 8 9 10 11 12
. X X X X . . . . . . .
Dice roll: 6 5
What is your move (V=values, S=sum, Q=quit)? V
Try again.
What is your move (V=values, S=sum, Q=quit)? S
1 2 3 4 5 6 7 8 9 10 11 12
. X X X X . . . . . X .
Dice roll: 4 5
What is your move (V=values, S=sum, Q=quit)? S
1 2 3 4 5 6 7 8 9 10 11 12
. X X X X . . . X . X .
Dice roll: 4 5
What is your move (V=values, S=sum, Q=quit)? S
Try again.
What is your move (V=values, S=sum, Q=quit)? V
Try again.
What is your move (V=values, S=sum, Q=quit)? Q
1 2 3 4 5 6 7 8 9 10 11 12
. X X X X . . . X . X .
Score = 44 NEW LOW SCORE!
Lowest Score = 44
Do you want to play again (Y=yes, N=no)?
Design Requirements (20 points) -Create designs for the classes needed in above requirements (no code necessary). You should have at least 2 classes, one for the “board” that does no input or output, and one containing the “void main” to manage the play of the game and handle all input and output. You can have more classes.
Class name
What are attributes necessary, their data types and valid ranges?
What are the methods necessary, their argument data types and their return value data type?
Create test cases for each class
Also write detailed pseudocode for what the “void main” would contain.
Code Requirements (80 points) -Code and test your application. You must have a separate test program for each non-“void main” class.