OK, to make absolutely sure I understand this:bob wrote:(1) if I disallow repetitions beyond a null with positions that occur before the null move, Elo goes down.
(2) if I allow repetitions beyond a null-move within the first 4 plies, Elo also goes down.
(A) Your reference is when you compare the current position to all positions since the last irreversible real move if there were no null moves in the last 4 ply.
(1) is the case where you only check back to the last null move
(2) is the case where you do check for repetitions since the last reversible real move even if there was a null move in the last 4 ply.
Both (1) and (2) perform worse than (A).
Correct?
Then I think I explained (2): Peformance is worse there, because all high-failing null-move searches now take larger depth, because the pattern <null> <move> <null> is doomed, and must be followed by the less reduced, and thus more expensive <null> <move> <move>. This blows p the tree. Bigger tree for the same depth => lower Elo.
