Author: Robert Hyatt
Date: 10:59:15 06/22/00
Go up one level in this thread
On June 22, 2000 at 11:27:49, Mogens Larsen wrote: >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 Nope. even on wrong predictions there are _many_ transpositions that make the incorrect pondering entries work. IE I ponder expecting you to play Nf3, but you play e3 instead. However, when I expected you to play Nf3, I discovered that your next move would be e3. Searching NF3/e3 in that order will then result in transpositions when you try e3 first, as e3/Nf3 is still the same thing. Also I know the difference between old positions and new positions, and I always choose to overwrite positions from an old search before I overwrite something from the current search.
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.