Author: blass uri
Date: 00:08:12 05/13/00
Go up one level in this thread
On May 13, 2000 at 02:39:33, blass uri wrote: >On May 12, 2000 at 23:14:33, Robert Hyatt wrote: <snipped> >>The problem here is that null-move searches are done at _every_ node in the >>tree. I can add that null move searches are not done at _every_ node in the tree. It is not done when depth=0 and you only have to evaluate the position and I guess that if you use null move with R=3 that it is not done in some other nodes when depth=1 or depth=2. I think that it is not done in most of the nodes. Please correct me if I am wrong. Uri
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.