Author: José de Jesús García Ruvalcaba
Date: 11:22:24 09/28/99
Go up one level in this thread
On September 28, 1999 at 13:42:00, Gian-Carlo Pascutto wrote: >Hi all, > >I'm adding nullmove search to my program and testing out >the different depth reduction possibilities. > >What I wonder now is what exactly you have to consider/test >when deciding the reduction factor. Some people use 1, some >use 2, maybe some use 3 even. > >What exactly do you risk to miss by using a bigger factor ? > >Also, does the actual depth the program reaches play part in >this consideration ? (e.g. if you only get 5 ply then R=2 or >R=3 are out of the question?) > >-- >GCP I am not a chess programmer, so it is posible that my suggestion is crap. Instead of doing the null search with depth n-R (where n is the depth of the non-null search), try k*n, where k is a factor between 0 and 1 (3/4 or 4/5 sound reasonable). I suggest this because some programs increase R for deeper searches. JJGR.
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.