michiguel wrote:That assumes that 40% of the time, when the prediction was wrong, the time was wasted. It is possible that it was not completely useless. In other words, searching a wrong move could still fill up the hashtable with useful information. Sometimes the prediction is wrong, but it will lead to a transposition later.
How do ponder miss and transposition tables relate?
Maybe 4 out of 10 times is not entirely wasted after all.
Nordlandia wrote:It fill up hash with useful information right?
Yes, sure some lines are the same for the two moves.
Wouldn't that mean that engine should reply somewhat faster in ponder matches, even with ponder miss opposed to running without ponder.
I.e expected move is not the follow up move by opposing engine, still due to transposition it may reply faster, directly provoked/triggered by pondering
Nordlandia wrote:It fill up hash with useful information right?
Yes, sure some lines are the same for the two moves.
Wouldn't that mean that engine should reply somewhat faster in ponder matches, even with ponder miss opposed to running without ponder.
I.e expected move is not the follow up move by opposing engine, still due to transposition it may reply faster, directly provoked/triggered by pondering
Depends on the time management of the engine. It can decide or not to reply faster. For example Andscacs can finish the search faster if the evaluation is more stable, but it evaluates also other thinks that can make it last longer.
