Author | testilus |
Submission date | 2013-05-02 19:37:49.269760 |
Rating | 6882 |
Matches played | 697 |
Win rate | 70.59 |
Use rpsrunner.py to play unranked matches on your computer.
#this is almost entirely copiet from "Cabu"'s "Markov (speedup)"
#but a bit optimised
import random
moves = ['R', 'P', 'S']
beat_move = {'R': 'P', 'P': 'S', 'S': 'R'}
output = ''
if input == '':
opp_history = ''
x = -1
else:
opp_history += input
for length in (84,52,38,30,26,22,18,16,14,12,10,9,8,7,6,5,4,3,2,1):
# Search for the last longest chain
x = opp_history[:-1].rfind (opp_history[-length:])
if x >= 0:
# If found: Pick what will be the next move and play against it
next_move = opp_history[x + length]
output = beat_move[next_move]
break
if output == '':
output = random.choice (moves)