For each set of values of the key bits on the right-hand side (referred to as a partial key), count how many times the approximation holds true over all the known plaintext-ciphertext pairs; call this count T. The partial key whose T has the greatest absolute difference from half the number of plaintext-ciphertext pairs is designated as the most likely set of values for those key bits. This is because it is assumed that the correct partial key will cause the approximation to hold with a high bias. The magnitude of the bias is significant here, as opposed to the magnitude of the probability itself.
for each set of values of the key bits on the right-hand side (referred to as a partial key) count how many times the approximation holds true over all the known plaintext-ciphertext pairs; call this count t the partial key whose t has the greatest absolute difference from half the number of plaintext-ciphertext pairs is designated as the most likely set of values for those key bits this is because it is assumed that the correct partial key will cause the approximation to hold with a high bias the magnitude of the bias is significant here as opposed to the magnitude of the probability itself