I suppose with an incrementing system, you could doll out the search space more efficiently. I imagine the more hash power you have, the more likely any two engines could randomly try the same nonce. (Assuming they were working off identical blocks). But it could be that there's a relationship between the way difficulty ratchets that keep the chances of testing the same nonces twice somewhat constant relative to the chance of finding a block.