In this programming assignment you will simulate a regular Poker game otherwise known as the 5-Card Draw. Regular Poker is played with a standard deck of 52 cards. Cards are ranked from high to low in the following order: Ace, King, Queen, Jack, 10, 9, 8, 7, 6, 5, 4, 3, 2. The value of an Ace is higher than a King which is higher than a Queen and so on. There are four suits - Spades, Hearts, Clubs, and Diamonds. The suits are of equal value.
Each player is dealt five cards. The player with the highest valued hand wins. The best to worst hands are ranked in the following order:
Royal Flush: A Royal Flush is made of 10, Jack, Queen, King, and Ace all of the same of suit.
Hand 1: 10S JS QS KS AS Hand 2: 10H JH QH KH AHThe probability of getting a royal flush is so low that ties are not broken.
Straight Flush: A straight flush is made of 5 cards in numerical sequence but of the same suit.
Hand 1: 3C 4C 5C 6C 7C Hand 2: 8D 9D 10D JD QDIf there are two straight flushes, then which ever hand has the highest card value wins. In the above example, Hand 2 wins.
Four of a Kind: In four of a kind, the hand must have four cards of the same numerical rank, e.g. four aces or four queens.
Hand 1: 9S 9H 9C 9D 10C Hand 2: QS QH QC QD 8SIn the event of a tie the hand that has highest ranking four of a kind cards wins. In the above example, Hand 2 wins.
Full House: For a full house, three of the cards must have the same numerical rank and the the two remaining cards must also have the same numerical rank but obviously different rank than the other three.
Hand 1: JS JH JD 4S 4C Hand 2: KH KC KD 10C 10DIf there are two full houses, then the hand that has the higher ranking cards for the three of a kind wins. In the above example, Hand 2 wins.
Flush: In a flush there are 5 cards all of the same suit. The numerical order does not matter.
Hand 1: 3S 5S 8S 10S KS Hand 2: 2D 6D 8D JD QDIn the event of two flushes, the one with the highest ranking card wins. In the above example, Hand 1 wins.
Straight: In a straight hand, the 5 cards are in numerical order but are not all of the same suit.
Hand 1: 3S 4D 5S 6H 7C Hand 2: 5D 6S 7C 8H 9HWhen there are two stright hands, then the one with the highest ranking card wins. In the above example, Hand 2 wins.
Three of a Kind: In three of a kind hand, there are 3 cards of the same rank and the other two are unrelated.
Hand 1: 6D 6S 6C KC 4H Hand 2: 8S 8D 8C 2H 5CWhen there are two three of a kind hands, the hand with the highest ranking three of a kind card wins. In the above example, Hand 2 wins.
Two Pair: In a two pair hand there are two cards of a matching rank, another two cards of a different matching rank, and a fifth random card.
Hand 1: 4D 4H 7S 7C 9S Hand 2: 9H 9D 5S 5C 3DWhen there are two hands that are two pair the hand having the highest pair wins. If the highest pair in both hands are of the same rank, then the highest second pair wins. If the two hands have two identical pairs, then the hand with the highest ranking fifth card wins. In the example, above, Hand 2 wins.
One Pair: In a one pair hand there are two cards of the same rank and the other three cards are unrelated.
Hand 1: 8S 8H 3D KC 7S Hand 2: 6D 6C 8S 5H 10DIn the event of a tie, then the hand with highest pair wins. If the two pairs are the same, then highest side card wins, and if necessary, the second highest side card, and finally the third highest side card can be used to break the tie. In the above example, Hand 1 wins.
High Card: If none of the hands in a game qualified under the categories listed above then the hand having the highest ranking card wins.
Hand 1: 9S 10D 4S 6H KC Hand 2: QS 3D 7H 10C 6DTo break a tie, the second-highest, third-highest, fourth-highest, and the smallest card can be used in order. In the above example, Hand 1 wins.
The overall structure of the program will be as follows:
class Card (object): ... class Deck (object): ... class Poker (object): ... def main(): ... main()
Here is a template of the code that you will find useful. You will be making additions to the code to fulfill the requirements. Feel free to write auxiliary functions if you need them.
In the function main() you will be prompting the user to enter the number of hands to play. Make sure that that number is between 2 and 6 inclusive. In the class Poker you will create that many hands from a single of deck of cards.
Most of the programming will be concentrated on writing the functions in the Poker class. Now, these functions will return a 0 if the hand does not fulfil that particular condition. For example, if the hand is not four of a kind the function isFour() will return 0. Otherwise it will return a number greater than 0 that can be used to order the hands and even break a tie according to the rules given above. There is a scheme that is suggested below that you may or may not use.
Assignment of Points to a Hand: This scheme assumes that you will systematically check if a hand meets the requirements from a Royal Flush to a High Card. Once a hand has met a certain criteria, say Straight Flush then you will not check if it meets the criteria lower down the ranking scale.
Here are the points (h) alloted for a hand:
total_points = h * 13^5 + c1 * 13^4 + c2 * 13^3 + c3 * 13^2 + c4 * 13 + c5where c1, c2, c3, c4, and c5 are the ranks of the cards in the hand, where c1 is the highest ranking card and c5 is the lowest ranking card. There are some variations to this rule that are mentioned below:
The file that you will be turning in will be called Poker.py. The file will have a header of the following form:
# File: Poker.py # Description: # Student's Name: # Student's UT EID: # Course Name: CS 313E # Unique Number: 53580 # Date Created: # Date Last Modified:
Your output session will look as follows:
Enter the number of hands to play: 3 Hand 1: 9D 9H 6C 8S 8C Hand 2: AS 2C 8H JD 4S Hand 3: 3C 7D 5S 6H 4H Hand 1: Two Pair Hand 2: High Card Hand 3: Straight Hand 3 wins.If there are ties then print out the hands in ascending order:
Hand 4 ties. Hand 6 ties.
Use the turnin program to submit your Poker.py file. The proctor should receive your work by 11 PM on Friday, 07 February 2014. We will be looking for clean logic and good documentation. There will be substantial penalties if you do not adhere to the guidelines. The student assistant in charge of this assignment is Bon Koo (firstname.lastname@example.org).