title: The algorithm that beats this New york times' Rock/Paper/ Scissors AI
body: <p>The algorithm that beats* this New York Times' AI without brute forcing in Rock/Paper/ Scissors? (in Veteran Mode)</p>
  
  <p><a href="http://www.nytimes.com/interactive/science/rock-paper-scissors.html?_r=1&amp;" rel="nofollow noreferrer">http://www.nytimes.com/interactive/science/rock-paper-scissors.html?_r=1&amp;</a>
  (flash must be enabled to play with the AI)(Website constantly gives info on how AI selects its next move after you played at least 5 times) </p>
  
  <p>I am learning machine learning on my own and I'm pretty novice. (Just started yesterday).  </p>
  
  <p>My friend told me they were assigned to solve above problem without learning any ML techniques in their ML class. I also wanted to do it but I cannot think any other way except brute forcing. </p>
  
  <p>For the training data set play with AI 100 or more time and collect those 100 or more data. Use this data to create an algorithm so that you win more games when using your program than without using your program. Being a super Novice, I can not think anything at all. </p>
  
  <p>any hints?
  Thanks    </p>