Author: Ryan B.
Date: 01:55:17 07/20/03
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? 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.