Author: Alex Boby
Date: 13:37:15 04/21/01
My PV search uses the assumption that when the minimal window search fails high, then the score returned is at least as high as the true score which will be returned when you search again with a wider a/b window. All was fine and dandy before hashing. Now I'm experiencing problems where this assumption is incorrect because the score from the minimal window search was returned via a hash table hit which was overwritten before the research takes place. So the research doesn't return a score >= min window score. And so I'm unsure about how to deal with the PV search now when the base assumption for that technique is invalid. Any suggestions are greatly appreciated :) Alex Boby
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.