Initial ML Chooser Implementation

[drofp]

Algorithm description found here

[drofp]

Reference Material:

• https://www.geeksforgeeks.org/descending-order-map-multimap-c-stl/
• http://www.cplusplus.com/reference/algorithm/sort/
• https://www.geeksforgeeks.org/passing-vector-function-cpp/

[drofp]

Implementation notes

• get frequency of each 3 possible choices (rock, paper, or scissors)
• pick highest of 3 frequencies, select corresponding move (as most likely choice player will make)
• return the move that beats the most likely player choice

Edge case details

• n can't be greater than total number of games per match
• do some default behavior (random algo) when game count is less than n