 Li (2007) says explicitly that the idea behind APavlov was to make an educated guess about what strategies would be entered, find an accurate, low-cost way to identify each during the initial stages of the game and then play an optimal strategy against each strategy so identified. For example, the strategies Cu, Du, GRIM, RANDOM, TFT, TFTT, TTFT, and P1, described in a  supplementary table,  had all appeared in previous tournaments. By defecting in round one, cooperating in round three, and choosing the opposite of one's opponent's round-one move in round two, one could identify any opposing strategy from among these nine in three moves. This identification process would be costly, however, because, by its first move, it eliminates any opportunity of cooperation with GRIM. Li chooses instead to employ TFT over the first six rounds as his identifying strategy, reducing cost at the expense of accuracy and range. It is worth noting that TFT cannot distinguish any pair of strategies that satisfy Axelrod's niceness condition (never being the first to defect). This means that it forgoes the chance to exploit unconditional cooperators. Li's entry won its tournament only because he guessed correctly that not many unconditional cooperators would be present. The lesson again is to remember that success depends on environment.