rpsCrack12.1

This program has been disqualified.

Source code:

import random
SIZE = 5
WEIGHT_FACTOR = 6.

class HistoryNode(object):
    def __init__(self, parent=None):
        if parent is not None:
            self.depth = parent.depth + 1
        else:
            self.depth = 0

        self.children = {'RR': None, 'RS': None, 'RP': None, 'SR': None, 'SS': None,
                         'SP': None, 'PR': None, 'PS': None, 'PP': None}

        self.distribution = {'RR': 0, 'RS': 0, 'RP': 0, 'SR': 0, 'SS': 0, 'SP': 0,
                             'PR': 0, 'PS': 0, 'PP': 0}

    def new_move(self, input):
        last_move = input[0:2]

        if len(input) > 2:
            if self.children[last_move] is None:
                self.children[last_move] = HistoryNode(self)
            self.children[last_move].new_move(input[2:])
        else:
            self.distribution[last_move] = self.distribution[last_move] * 0.975 + 1

    def predict(self, input):
        if len(input) > 0:
            last_move = input[0:2]
            if self.children[last_move] is not None:
                return self.children[last_move].predict(input[2:])
            else:
                return None
        else:
            return self.distribution


class HistoryTree(object):
    def __init__(self):
        self.root = HistoryNode()

        self.input = ''

    def new_move(self, move):
        self.input += move
        if len(self.input) > SIZE * 2:
            self.input = self.input[-SIZE * 2:]

        for i in xrange(2, len(self.input) + 1, 2):
            self.root.new_move(self.input[-i:])

    def predict(self):
        results = {'R':0, 'S':0, 'P':0}
        for i in xrange(2, len(self.input) + 1, 2):
            res = self.root.predict(self.input[-i:])
            if res is not None:
                for key in res:
                    results[key[1]] += res[key] * (WEIGHT_FACTOR ** i)

        d = results
        e = d.keys()
        e.sort(cmp=lambda a, b: cmp(d[a], d[b]))
        return e[-1]
    
    def predict_i(self, i):
        results = {'R':0, 'S':0, 'P':0}
        for depth in xrange(i, -1, -1):
            res = self.root.predict(self.input[-depth * 2:])
            if res is not None:
                break
        
        if res is None:
            return random.choice(["R", "P", "S"])
        else:
            for key in res:
                results[key[1]] += res[key]
            
        d = results
        e = d.keys()
        e.sort(cmp=lambda a, b: cmp(d[a], d[b]))
        return e[-1]


if input == '':
    history_tree_me = HistoryTree()
    history_tree_him = HistoryTree()
    output = random.choice(["R", "P", "S"])
    meta_predictor = [output] * (6 * SIZE + 6 + 6 + 1)
    metascore = [0] * (6 * SIZE + 6 + 6 + 1)
    win = ['RS', 'SP', 'PR']
    lost = ['SR', 'PS', 'RP']
    prediction_me_i = [output] * SIZE
    prediction_him_i = [output] * SIZE
    possible_moves = ['R', 'P', 'S']
else:
    history_tree_me.new_move(output + input)
    history_tree_him.new_move(input + output)
        
    for idx in xrange(len(metascore)):
        if meta_predictor[idx] + input in win:
            metascore[idx] = metascore[idx] * 0.9 + 1
        elif meta_predictor[idx] + input in lost:
            metascore[idx] = metascore[idx] * 0.9 - 1
        else:
            metascore[idx] = metascore[idx] * 0.9 - 0.34
            
        
    prediction_me = history_tree_me.predict()
    prediction_him = history_tree_him.predict()
    for j in xrange(SIZE):
        prediction_me_i[j] = history_tree_me.predict_i(j)
        prediction_him_i[j] = history_tree_him.predict_i(j)
        
    for i in xrange(3):
        move_me = possible_moves[(possible_moves.index(prediction_me) + i) % 3]
        move_him = possible_moves[(possible_moves.index(prediction_him) + i) % 3]
        meta_predictor[i] = move_me
        meta_predictor[i + 3] = move_him
        for j in xrange(SIZE):
            move_me = possible_moves[(possible_moves.index(prediction_me_i[j]) + i) % 3]
            move_him = possible_moves[(possible_moves.index(prediction_him_i[j]) + i) % 3]
            meta_predictor[i + (j + 1) * 6] = move_me
            meta_predictor[i + 3 + (j + 1) * 6] = move_him
        
    tmp = []
    for j in range(6):
        for i in range(0, len(meta_predictor) - 8, 6):
            tmp.append(meta_predictor[i + j]) 
        occ = [tmp.count('R'), tmp.count('P'), tmp.count('S')]
        meta_predictor[-7 + j] = possible_moves[occ.index(max(occ))]
    
    meta_predictor[-1] = random.choice(possible_moves)
    
    best_predictor = metascore.index(max(metascore))

    output = meta_predictor[best_predictor]