Sorting hands of cards that match rank and order in python

Question

I am attached to a card game, and at the moment I am working on its beginning. What confuses me is sorting cards in a hand according to their rank, and then much more, how to reduce repetition. At the moment, I could create a for loop to organize the maps, and then have 52 different ones, if for every opportunity, but I was wondering if this is an easier way to do this and a lot of other repetitive tasks. Thanks: D I will put the code below:

from random import shuffle class deckOfCards: def __init__(self): self.rank = ['2','3','4','5','6','7','8','9','T','J','Q','K','A'] self.suit = ['C', 'S', 'H', 'D'] self.deck = [r+s for r in self.rank for s in self.suit] shuffle(self.deck) def setValue(self, deck): cnt = 1 self.value = {} for i in self.deck: self.value[i] = cnt cnt += 1 class Deal: def __init__(self, deck, position): self.hand = deck[position::4] #divides the deck into 4 hands hand = self.hand def value(self, key): # Gives each card that the player has a value newHand = {} for i in self.hand: if i in key: newHand[i] = key[i] return newHand deck = deckOfCards() player1 = Deal(deck.deck, 0) ####################################### player2 = Deal(deck.deck, 1) # Example of repetition that I wanted # player3 = Deal(deck.deck, 2) # to get rid of if possible # player4 = Deal(deck.deck, 3) ####################################### 

EDIT: I think this is very good for sorting cards, but I'm still confused on how to eliminate some repetitions. Thanks for the help: D

 def sortHand(player): hand = player.hand for i in hand: for i in hand: index = player1.hand.index(i) if index != 12: if deck.value[i] > deck.value[hand[index+1]]: hand.insert(index+1, hand.pop(index)) 

Answer 1

I would simplify this a bit:

 from random import shuffle class Hand(list): pass class Deck(object): rank = '23456789TJQKA' suit = 'CSHD' def deal(self, n): deck = [r+s for r in Deck.rank for s in Deck.suit] shuffle(deck) return [Hand(sorted(deck[i::n], key=Deck.cmpkey)) for i in xrange(n)] @staticmethod def cmpkey(card): return Deck.rank.index(card[0]), Deck.suit.index(card[1]) print Deck().deal(4) 

With this arrangement, the result of deal() is a four-hand list. Each hand is sorted by rank, then fits.

(I did not fully understand the logic of "value", so I left it in my example.)