all2one awakening :: Code Drill #2

Code Drill #2
Game Development
2008/08/21 11:08
code drill, Python, 코드 도장, 파이썬
Posted by all2one
JJ가 읽고 있는 책

Jaewon Jung's favorite books »

JJ가 읽은 책

Jaewon Jung's favorite books »

JJ가 읽을 책

Jaewon Jung's favorite books »
<a href="http://www.formspring.me/all2one">http://www.formspring.me/all2one</a>

Code Drill #2

This was our second problem in Code Drill.

Following's my solution in Python(It may have several bugs. Use at your own risk... ;) ).

import sys
import fileinput

# Programming Challenges Problem #10
class PokerCards:
    def __init__(self, card_list):
        assert len(card_list) == 5
        self.pieces = {}
        self.grade = 0
        self.sorted = []    # It's for High Card.
        for card in card_list:
            assert len(card) == 2
            aux_table = {'T':10, 'J':11, 'Q':12, 'K':13, 'A':14}
            num = aux_table.get(card[0], 0)
            if num == 0:
                num = int(card[0])
            self.pieces[num] = self.pieces.get(num, '') + card[1]
            self.sorted.append(num)
        self.sorted.sort(reverse=True)
        self.grade = self.evalute()

# Evalute the grade.
    def evalute(self):
        keys = sorted(self.pieces.keys())
        values = self.pieces.values()
        items = self.pieces.items()
        if ''.join(values) == values[0][0]*5 \
            and keys == [k for k in range(keys[0],5+keys[0])]:  # Straight Flush
            return 0x900000 + keys[4]
        elif len(filter(lambda k:len(k)>=4, values)) > 0:       # Four Cards
            return 0x800000 + filter(lambda x:len(x[1])>=4, items)[0][0]
        elif len(keys) == 2:                                    # Full House
            return 0x700000 + filter(lambda x:len(x[1])>=3, items)[0][0]
        elif ''.join(values) == values[0][0]*5:                 # Flush
            return 0x600000 + reduce(lambda x,y:x*16+y, self.sorted)
        elif keys == [k for k in range(keys[0],5+keys[0])]:     # Straight
            return 0x500000 + keys[4]
        elif len(filter(lambda k:len(k)>=3, values)) > 0:       # Three Cards
            return 0x400000 + filter(lambda x:len(x[1])>=3, items)[0][0]
        elif len(filter(lambda k:len(k)>=2, values)) > 1:       # Two Pairs
            return 0x300000 + reduce(lambda x,y:x[0]*16+y[0], sorted(items, key=lambda x:len(x[1])*16+x[0], reverse=True))
        elif len(filter(lambda k:len(k)>=2, values)) > 0:       # One Pair
            return 0x200000 + reduce(lambda x,y:x[0]*16+y[0], sorted(items, key=lambda x:len(x[1])*16+x[0], reverse=True))
        else:                                                   # High Card
            return 0x100000 + reduce(lambda x,y:x*16+y, self.sorted)
    
    def __cmp__(self, other):
        return self.grade - other.grade
        
def main(argv=None):  
    if argv is None:  
        argv = sys.argv  
        
    f = fileinput.input()
    line = f.readline()
    while line:
        line = line.split()
        if len(line) <> 10:
            break
        black = PokerCards(line[0:5])
        white = PokerCards(line[5:10])
        if black > white:
            print "Black wins."
        elif black < white:
            print "White wins."
        else:
            print "Tie."
        line = f.readline()
    f.close()
    
if __name__ == "__main__":  
    sys.exit(main())

크리에이티브 커먼즈 라이선스

이 저작물은 크리에이티브 커먼즈 코리아 저작자표시-비영리-변경금지 2.0 대한민국 라이선스에 따라 이용하실 수 있습니다.

'Game Development' 카테고리의 다른 글

SSAO and Deferred Rendering (0)	2008/09/11
크라이텍에서의 첫 주 (7)	2008/09/06
Code Drill #2 (0)	2008/08/21
C++0x == C++09 ? (0)	2008/08/19
How to Fail with Agile (0)	2008/08/18
the Ten Commandments of Debugging (0)	2008/08/14