To be specific about the RPS problem, model the player and computer as two functions of [all the previous plays] that return the next play. A round is run by u

To be specific about the RPS problem, model the player and computer as two functions of [all the previous plays] that return the next play. A round is run by using each function to calculate a play based on all previous plays, then comparing the results. Now imagine you've got the "perfect" model as the computer player, that wins every time against humans. A particularly crafty human player shows up, named Cantor. His function is defined as "the choice that beats what the computer's model returns". How often does he win? This construction only works for simple games like RPS where the two players are interchangeable and a move has a well-defined "opposite".