There are 5^N possible strings for a handshake that lasts N turns. Select the handshake strong randomly. If the handshake is successful, the probability that the bot it is playing against is itself is (1 − 5^-N).
Using N = 3, we can establish with a Pr(0.992) that we are playing against a copy of ourself within 3 turns.
2 turns would be spent renormalising if we are not playing against ourself.
There are 5^N possible strings for a handshake that lasts N turns. Select the handshake strong randomly. If the handshake is successful, the probability that the bot it is playing against is itself is (1 − 5^-N).
Using N = 3, we can establish with a Pr(0.992) that we are playing against a copy of ourself within 3 turns.
2 turns would be spent renormalising if we are not playing against ourself.