Author: Uri Blass
Date: 04:28:42 07/30/02
Go up one level in this thread
On July 29, 2002 at 17:39:53, Uri Blass wrote: <snipped> >I am going to write it in valid C but first I need to understand what I need to >store in the hash tables when the depth is 0 and when to store moves that lead >to exact scores and how to do it. > >Uri I think that I know the problem that caused my program to be slower after adding exact scores. The remaining depth when I call qsearch can be smaller than 0 because of null move pruning (it was no problem in regular search because in that case I call qsearch when the remaining depth is 0 but it was a problem when I tried to probe the hash tables with the remaining depth. I think that I will change the line val=-alphabeta(depth-4,-beta,-beta+1); to the line if (depth>=4) val=-alphabeta(depth-4,-beta,-beta+1); else val=-quies(...) This may do movei 0.3% faster based on a fast test that I did. I cannot change it to depth>4 because extensions may do alphabeta(0,-beta,-beta+1) different than the result of the qsearch. Uri
This page took 0.01 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.