Transcribed TextTranscribed Text

Assignment Overview Programming Project #6 This assignment focuses on the design, implementation and testing of a Python program which uses classes to solve the problem described below. Note: you are using a class we provide; you are not designing a class. Assignment Background The goal of this project is to gain practice with use of classes and creating functions. You will design and implement a Python program which plays simplified Texas Hold’em Poker. The program should deal two cards to two players (one card to each player, then a second card to each player), and then five community cards which players share to make their hands. A poker hand is the best five cards from the community cards plus the player’s cards (i.e., best 5 out of 7 cards total). The goal of this assignment is to find the category of each player’s hand and determine the winner. The rules of this game are relatively simple and you can find information about the game and about the poker hands in the links below. Keep in mind that you will only find the category of the hands and all nine cards can be dealt at once (a real poker game deals cards in stages to allow for betting, but we aren’t betting). The categories in order from lowest to highest are: High card, 1 pair, 2 pair, 3 of a kind, straight, flush, full house, 4 of a kind, straight flush. You will not find a player’s hand’s value, but just the category of the hand. It is a tie if both players have hands in the same category. That is, if both of them have straights, it is considered a tie no matter who has the higher straight.Our game is simplified in two ways: 1. We only compare categories to determine the winner, not the value of the hands. For example, in a real poker game the winner of hands with exactly one pair would be determined by which pair had the highest card rank. That is, a pair of 10s wins over a pair of 3s. In our game, two hands with exactly one pair is considered a tie with no consideration given to the card ranks. 2. The Card class ranks an Ace as the lowest card in a suit; whereas traditional poker ranks an Ace as highest. For simplicity, we will keep Aces as the lowest ranked card because we are only comparing categories not values. In particular, the cards 10h, Jh, Qh, Kh, Ah are not considered to make a straight in our game (they would under normal poker rules). Assignment Specifications 1. Your program will use the Card and Deck classes found in the file named You may not modify the contents of that file: we will test your project using our copy of We have included a program to illustrate how to use the Card and Deck classes. 2. Your program will be subdivided into meaningful functions. Use a function for each category (except that “high-card” doesn’t need a function). See hints below. 3. Your program will display each player’s dealt cards, the community cards, and announce the winner of the hand. Also, your program will display the winning combination (or either of the winning combinations, if a tie) as well as the category of the winning hand (see sample output below). For example, if the winning combination is “four-of-a-kind”, those four cards will be displayed; the fifth card in the hand will not be displayed. The display will be appropriately labeled and formatted. 4. After each run, the program will prompt the user if they want to see another hand: “do you want to continue: y or n”. The program should continue if user enters “y” or “Y”; otherwise, the program should halt. Also, if there are fewer than 9 cards left in the deck, the program should halt. Do not shuffle between hands; only shuffle at the beginning of the program. 5. Using dictionaries in this assignment is very useful as you can find how many cards have the same suit, or how many of them have the same rank. Most of my functions used a dictionary that had rank as the key, so I created a separate function to build such a dictionary from a hand. Hints 1. There are 9 categories of hands. For each category (except high-card), I wrote a function that would take as an argument a list of 7 cards and return either a sub-list of cards that satisfied that category or an empty list. That design let me use the functions in Boolean expressions since an empty list evaluates to False whereas a non-empty list evaluates to True. Returning a list of cards also allowed me to use functions within functions, e.g., a straight flush must be a flush. Returning a list of cards also made testing easier because I could see not only that the function had found a combination of that type, but I also could easily check that it was correct. By the way, the function to find a straight was the hardest function to write. 2. Finding a winner is simple: start with the highest category and work your way down the categories in a cascade of “if” and “elif” statements. The result is a long, but repetitive structure. (You do not need to check all possible combinations of hands because you are only trying to find the highest category that a hand fits.) 3. Think strategically for testing. Custom build a set of hands for testing by creating particular cards, e.g. H1 = [5c, 2c, 5h, 4s, 3d, 2h, 5d] can be used to test for a full house (I had to create each card first, e.g. c1 = cards.Card(5,1) to create the 5c card in H1. It took many lines to create the testing hands, but once built they proved useful.) Test each category function separately using the custom hands you created for testing. For example, result = full_house(H1) should yield a result [5c, 5h, 5d, 2c, 2h]. 4. I found dictionaries useful within functions. Sometimes using the rank as key worked best; other times using the suit as key was best. 5. In order for sort() and sorted() to work on any data type the less-than operation must be defined. That operation is not defined in the Cards class so neither sort() nor sorted() work on Cards. (We tried to make the Cards class as generic as possible to work with a wide variety of card games, and the ordering of cards considering both rank and suit varies across card games.) 6. Mirmir testing: these are arbitrary to match the tests in Mirmir. a. For ties print hand1. b. Dealing: common hand first, then hand 1, then hand 2 (I used list comprehension) c. I provided a function named connanical that orders hands to match Test 1 and Test 2 in Mirmir (individual Function Tests don’t care about order). If more than five cards are in a category, e.g. all seven cards are the same suit, I applied cannonical() before slicing off the first 5 cards. d. Since Mimir cannot handle the Unicode suit symbols, the suit_list was changed to characters. You don’t need to do anything—this is built into the used for testing on Mimir. When you look at the Mirmir output you will see characters rather than symbols for suits: suit_list = ['x','c','d','h','s'] Sample Output Test 1 ---------------------------------------- Let's play poker! Community cards: [9♠, 7♥, 6♥, 6♣, 4♠] Player 1: [4♣, 10♠] Player 2: [7♣, 10♣] TIE with two pairs: [4♣, 4♠, 6♣, 6♥] Do you wish to play another hand?(Y or N) y ---------------------------------------- Let's play poker! Community cards: [Q♣, K♦, K♣, K♠, 7♠] Player 1: [K♥, 10♦] Player 2: [Q♥, J♣] Player 1 wins with four of a kind: [K♣, K♦, K♥, K♠] Do you wish to play another hand?(Y or N) n Test 2 ---------------------------------------- Let's play poker! Community cards: [9♠, 7♥, 6♥, 6♣, 4♠] Player 1: [4♣, 10♠] Player 2: [7♣, 10♣] TIE with two pairs: [4♣, 4♠, 6♣, 6♥] Do you wish to play another hand?(Y or N) y ---------------------------------------- Let's play poker! Community cards: [Q♣, K♦, K♣, K♠, 7♠] Player 1: [K♥, 10♦] Player 2: [Q♥, J♣] Player 1 wins with four of a kind: [K♣, K♦, Do you wish to play another hand?(Y or N) y ---------------------------------------- Let's play poker! Community cards: [3♣, 6♦, A♣, 8♣, 2♣] Player 1: [9♣, 5♣] Player 2: [10♥, 4♣] TIE with a flush: [A♣, 2♣, 3♣, 5♣, 8♣] Do you wish to play another hand?(Y or N) y ---------------------------------------- Let's play poker! Community cards: [9♦, 8♦, 5♦, Q♠, Q♦] Player 1: [J♠, J♦] Player 2: [4♦, A♥] TIE with a flush: [5♦, 8♦, 9♦, J♦, Q♦] Do you wish to play another hand?(Y or N) y ---------------------------------------- Let's play poker! Community cards: [2♥, 3♥, A♠, 2♣, 3♠] Player 1: [2♦, A♦] Player 2: [8♠, A♣] K♥, K♠] Player 1 wins with a full house: [A♦, A♠, 2♣, 2♦, 2♥] Deck has too few cards so game is done. Scoring Rubric Scoring Summary General Requirements ______ 5 pts Coding Standard Implementation Fulfills specifications including the following: ______ ______ ______ ______ (40 pts) 8 Category functions: High-card doesn't need one (5 pts each) (15 pts) Main: all categories are considered (15 pts) Test 1 (20 pts) Test 2

Solution PreviewSolution Preview

These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.

Poker game

import cards

def less_than(c1,c2):
          True if c1 is smaller in rank,
          True if ranks are equal and c1 has a 'smaller' suit
          False otherwise'''
    if c1.rank() < c2.rank():
       return True
    elif c1.rank() == c2.rank() and c1.suit() < c2.suit():
       return True
    return False
def min_in_list(L):
    '''Return the index of the mininmum card in L'''
    min_card = L[0] # first card
    min_index = 0
    for i,c in enumerate(L):
       if less_than(c,min_card): # found a smaller card, c
            min_card = c
            min_index = i
    return min_index
def cannonical(H):
    ''' Selection Sort: find smallest and swap with first in H,
       then find second smallest (smallest of rest) and swap with second in H,
       and so on...'''
    for i,c in enumerate(H):
       # get smallest of rest; +i to account for indexing within slice
       min_index = min_in_list(H[i:]) + i
       H[i], H[min_index] = H[min_index], c # swap
    return H

def flush_7(H):
    '''Return a list of 5 cards forming a flush,
       if at least 5 of 7 cards form a flush in H, a list of 7 cards,
       False otherwise.
    # 5 cards of the same suit
    suits = {}
    # make dictionary of same suit
    for c in H:
       if c.suit() in suits:
            suits[c.suit()] = [c]
       if len(suits[c.suit()]) >= 5:

    # return entry with 5 cards of same suit
    for k,v in suits.items():
       if len(v)>= 5:
            return v
    return False

def straight_7(H):
    '''Return a list of 5 cards forming a straight,
       if at least 5 of 7 cards form a straight in H, a list of 7 cards,
       False otherwise.'''
    # Sequence of 5 cards in increasing value

    H = sorted(H, key=lambda x: x.rank())
    for i in range(3):
       cards = [H[i]]
       for j in range(i+1,len(H)):
            if j < len(H)-1:
                if (H[j].rank() == H[j-1].rank()+1) and (H[j].rank() == H[j+1].rank()-1):
                if (H[j].rank() == H[j-1].rank()+1):
            if len(cards)>=5:
                return cards
    return False

def straight_flush_7(H):
    '''Return a list of 5 cards forming a straight flush,
       if at least 5 of 7 cards form a straight flush in H, a list of 7 cards,
       False otherwise.
    # Straight of the same suit
    H = sorted(H, key=lambda x: x.rank())

    if flush_7(H) == straight_7(H):
       return flush_7(H)
    return False

def four_7(H):
    '''Return a list of 4 cards with the same rank,
       if 4 of the 7 cards have the same rank in H, a list of 7 cards,
       False otherwise.
    # four cards with the same value
    ranks = {}
    # make dictionary of same rank
    for c in H:
       if c.rank() in ranks:
            ranks[c.rank()] = [c]

    # return entry with 4 cards of same rank
    for k,v in ranks.items():
       if len(v)== 4:
            return v
    return False

def three_7(H):
    '''Return a list of 3 cards with the same rank,
       if 3 of the 7 cards have the same rank in H, a list of 7 cards,
       False otherwise.
       You may assume that four_7(H) is False....

By purchasing this solution you'll be able to access the following files:

for this solution

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

Find A Tutor

View available Python Programming Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.

Upload a file
Continue without uploading

We couldn't find that subject.
Please select the best match from the list below.

We'll send you an email right away. If it's not in your inbox, check your spam folder.

  • 1
  • 2
  • 3
Live Chats