Author: David Rasmussen
Date: 12:55:34 11/27/02
Go up one level in this thread
On November 27, 2002 at 11:29:35, Uri Blass wrote: >On November 27, 2002 at 10:01:02, David Rasmussen wrote: > >I am almost sure that some commercial and private programs use it so it is not >someone will beat you but someone beated you. > I'm also sure that some commercials uses this idea. >Latest not public movei already use negative extensions or something similiar >and I found that it was productive for the strength of the program. > >I am not sure that it is exactly negative extensions because if I find based on >search to reduced depth that the move is interesting then I search it again and >not to reduced depth. > >Null move verification is exactly negative extensions if you do not do research >because it tells you to search to reduced depth if there is no threat. > Null move search is not the negative extensions idea, but verified null move search is, kind of. It just happens that the criterion on which you decide to search less deep or not, is a dynamic one, a null move search. /David
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.