This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 15-100 PROGRAM 7 - FALL 2007Due: Monday, November 5 by 11:59PM using electronic hand-in BACKGROUNDIn the game of Super 21, the object is to get as close to a total of 21 as possible without going over. The game is played with an ordinary deck of 52 playing cards. The cards that show 2-9 are worth their face values. 10, J, Q, and K are worth 10, and A is always worth 11. The player is dealt 2 cards and their rank values are added to the player's total. The player is asked if he/she wants another card. Each time the player answers yes, the player gets another card that is added to his/her total. The player continues until either he/she answers no or the player reaches 21 or more. The player's winnings for the round is determined as follows: TOTAL WINNINGS 21 $2000 20 $1000 19 $500 18 $250 < 18, > 21 $0 ASSIGNMENTDownload the zip file Super21.zipfrom the course website. This file, when uncompressed, contains a folder that has twoJava classes. Load this project folder into Eclipse. One class is the PlayingCardclass that simulates a playing card from a standard deck of cards. Every card has two properties that define its state: its suit (a string: "HEARTS", "CLUBS", "SPADES" or "DIAMONDS") and its rank (a character: '2', '3', '4', '5', '6', '7', '8', '9', 'T' for 10, 'J' for Jack, 'Q' for Queen, 'K' for King and 'A' for Ace). '9', 'T' for 10, 'J' for Jack, 'Q' for Queen, 'K' for King and 'A' for Ace)....
View Full Document
This note was uploaded on 01/25/2010 for the course CS 15100 taught by Professor Tom during the Fall '07 term at Carnegie Mellon.
- Fall '07