Author: Vincent Diepeveen
Date: 08:20:31 07/21/03
Go up one level in this thread
On July 20, 2003 at 13:02:26, Omid David Tabibi wrote: >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? > >If null-move search results in a reduction, (depth = depth - 1), then store the >reduced depth in the hash table. > >>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. > >It is perfectly fine. Reductions are usually in higher parts of the tree, and >cutoff closer to leafs, so the number of cutoffs will be much higher. > >What is the total node count you get in vrfd R=3 in comparison to std R=2 and >std R=2 ? This is bullshit science. Time to solution counts. Note that finding tricks fast says nothing about playing strength either. > >> >>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.