This program has been disqualified.
Author | Thomas Holmes |
Submission date | 2011-06-10 18:12:57.467313 |
Rating | 3333 |
Matches played | 33 |
Win rate | 33.33 |
#Carbine.py, an [hopefully] intelligent RPS prediction AI.
import random
ROCK = "R"
PAPER = "P"
SCISSOR = "S"
MAX_CYCLE = 10
MIN_CYCLE = 5
output = ""
if input == "":
history = []
weight = {}
else:
history.append(input)
#change this whole mess to operate only on slices, building lists is
#very unnecessary
weight = {ROCK:0, PAPER:0, SCISSOR:0}
for i in range(MAX_CYCLE):
if (len(history) < (MIN_CYCLE - 1)) or (i < (MIN_CYCLE - 1)):
continue
else:
testMoves = history[-(i+1):]
for j in range(len(history) - i):
testCycle = history[j:j+i]
#if it matches up, add the length of the chain
if testMoves == testCycle:
guess = history[j+i+1]
weight[guess] = weight[guess] + i
print(weight)
r = weight.get(ROCK, 0)
p = weight.get(PAPER, 0)
s = weight.get(SCISSOR, 0)
if (r > p) and (r > s):
output = PAPER + "X"
elif p > s:
output = SCISSOR
elif (s != p) and (s != r):
output = ROCK
else:
output = random.choice([ROCK, PAPER, SCISSOR])
if output == "":
output = random.choice([ROCK, PAPER, SCISSOR])