Derek Nalls wrote on Tue, May 27, 2008 04:11 PM UTC:
I have read that most computer chess programmers use the brute force method
initially when the plies can be cut thru quickly and then switch to use
advanced pruning techniques to focus the search from then on. This lead
to my mis-interpretation that Joker80 would have more moves under
consideration as the best at short time controls than long time controls.
Some moves that score highly-positive after only a few-several plies will
score lowly-positive, neutral or negative after more plies. Thus, I do
not see how the number of moves under consideration as the best could
prevent being reduced slightly with plies completed. As a practical
concern, there is rarely any benefit in accepting the CPU load associated
with, for example, checking a low-score positive move returned after
13-ply completion thru 14-ply completion (for example) when other
high-score positive moves exist in sufficient number.
