Author: Mogens Larsen
Date: 08:27:49 06/22/00
Go up one level in this thread
On June 22, 2000 at 11:13:45, Robert Hyatt wrote: >Not particularly. The main thing it does is that it assumes it will predict >correctly and save time later in the game... so that it will use this time >earlier in the game (before it has actually saved it up.) The target time >per move is based on this anticipated time savings... but whether it predicts >correctly or incorrectly doesn't cause an adjustment in the target time for >any single move... So the search results from the incorrectly predicted move, that is presumeably (?) stored in hash, don't cause significant problems? Forgive me, if this sounds like jibberish. What I'm trying to ask is: Won't the data achieved through incorrect ponder clash with the data created through the new search? Best wishes... Mogens
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.