Table 1. Strategy set in the repeated prisoner's dilemma with one round memory.

	Strategy	Behavior	Binary code
0	ALLC	Always cooperate	000
1	TFT	Tit for tat	001
2	TFT	Cooperate on the first move	010
		then reverse the opponent's last move
3	NALLD	Cooperate once and then always defect	011
4	SALLC	Defect once and then always cooperate	100
5	STFT	Defect once and then copy the opponent's last move	101
6	STFT	Defect once and then reverse the opponent's last move	110
7	ALLD	Always defect	111

For the uniform mutation kernel, it is convenient to number the strategies with integers, for the bitwise kernel binary numbers are more convenient.