# UCBDirichlet

 Author Sean Submission date 2016-02-21 11:10:14.780027 Rating 6094 Matches played 422 Win rate 61.37

Use rpsrunner.py to play unranked matches on your computer.

## Source code:

``````if input == "":

import collections
import math
import random

gamma = random.gammavariate
sqrt = math.sqrt
log = math.log
R, P, S = 0, 1, 2
index = {"R": R, "P": P, "S": S}
beat = (P, S, R)
name = ("R", "P", "S")
third = 1.0 / 3.0

class MarkovTree:
def __init__(self, counts = None):
self.counts = [0.0 for _ in xrange(3)]
self.visits = [0.0 for _ in xrange(3)]
self.children = None

def select_move(self, t):
r = gamma(self.counts[0] + 2, 1)
p = gamma(self.counts[1] + 2, 1)
s = gamma(self.counts[2] + 2, 1)
scores = [s - p, r - s, p - r]
best = max(scores)
return (best, scores.index(best))

def update(self, h, i):
for n in h:
self.counts[i] += 1
if self.children is None:
break
self = self.children[n]
if self is None:
break

def predict(self, h):
path = []
stop = False
path.append(self)
for d, n in enumerate(h):
if stop or d >= 16:
break
if self.children is None:
self.children = [None for _ in xrange(3)]
if self.children[n] is None:
self.children[n] = MarkovTree()
stop = True
child = self.children[n]
self = child
path.append(self)
t = sum(6 + sum(node.visits) for node in path)
best_score = float("-inf")
for i, n in enumerate(path):
score, move = n.select_move(t)
if score >= best_score:
j = i
best_score = score
best_node = n
best_move = move
return (best_node, best_move)

tree = MarkovTree()
history = collections.deque([])

node = tree

else:

i = index[input]
j = index[output]

node.visits[j] += 1
tree.update(history, i)

history.appendleft(i)
history.appendleft(j)

node, k = tree.predict(history)
output = name[k]``````