# Ent6

 Author Sean Submission date 2016-03-01 16:00:42.175021 Rating 6784 Matches played 432 Win rate 70.14

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

## Source code:

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

import collections
import random
import math

exp = math.exp
log = math.log
third = 1.0 / 3
expected_entropy = -log(third)
gamma = random.gammavariate

def match_entropy(v, h0):
h0 = -h0
p = [third, third, third]
k0 = -0.05
k = k0
error = 1
n = 0
while abs(error) >= 0.0001 * -h0:
p = [exp(k * vi) for vi in v]
t = sum(p)
f = 1.0 / t
p = [pi * f for pi in p]
if n >= 10 or any(x == 0 for x in p):
return p
n += 1
h = [log(pi) * pi for pi in p]
h1 = sum(h)
dh = sum((log(pi) + 1) * vi * pi for vi, pi in zip(v, p))
if dh == 0:
return p
error = h1 - h0
k = k - error / dh
return p

class MarkovTree:
def __init__(self):
self.them = [0 for _ in xrange(3)]
self.children = None

def update(self, h, i, j):
stop = False
for d, k in enumerate(h):
self.them[i] += 1
if stop or d >= 16:
return
if self.children is None:
self.children = [None for _ in xrange(3)]
if self.children[k] is None:
self.children[k] = MarkovTree()
stop = True
return
self = self.children[k]

def predict(self, h):
entropy = expected_entropy
result = [third, third, third]
for i, k in enumerate(h):
t = sum(self.them)
f = 1.0 / (t + 21.0)
p = [(n + 7.0) * f for n in self.them]
e = -sum(pi * log(pi) for pi in p)
if e <= entropy:
entropy = e
result = p
if self.children is None:
break
child = self.children[k]
if child is None:
break
self = child
return result, entropy
R, P, S = 0, 1, 2
index = {"R": R, "P": P, "S": S}
name = ("R", "P", "S")
tree = MarkovTree()
history = collections.deque([])
epoch = 1.0

else:
print(input)
i = index[input]
j = index[output]

tree.update(history, i, j)
history.appendleft(i)
history.appendleft(j)
them, h_them = tree.predict(history)
r, p, s = them
scores = [-(s - p), -(r - s), -(p - r)]
ps = match_entropy(scores, h_them)
r = random.random()
x = 0
for i in xrange(3):
x += ps[i]
if r <= x:
break
output = name[i]``````