Author: Vincent Diepeveen
Date: 08:15:30 07/21/03
Go up one level in this thread
On July 20, 2003 at 04:55:17, Ryan B. wrote: >Questions about verified null move > >1. Should the verify be stored in the hash table? At this time I store the >verify in hash but think I am doing something wrong. My program is playing >stronger with standard null move set to R=3 than verified null move with R = 3. >Possibly the verify should not be sorted? This is a correct conclusion. Verified nullmove is not improving your program except if you test it at mating positions where checks matter a lot so it gives you another ply then to find tricks 1 ply sooner. However it will play worse. Also it basically shows how bad a qsearch is when in such positions you do not find the mate in qsearch. Also note that overhead of verified nullmove is pretty big. The way in which Omid compared in his article is scientific not correct. >2. Is it normal to get more cuts in a search than reductions? From The starting >position I get 18636 reductions and 53901 cuts in 494148 nodes searched (360543 >of them Qnodes). To me this does not look like it can be right. > >Thanks >-Ryan
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.