Author: Uri Blass
Date: 16:44:57 08/31/04
Go up one level in this thread
On August 31, 2004 at 19:43:08, Uri Blass wrote: >>Uri, >> >>For short searches of 1 second on my box, I've found adaptive null move >>with varying R to give better results than verified null move with R=3. > >Note that I use verified null move pruning only in the endgame and in the >middlegame I use null move pruning with no verification. > >I did not test a lot of possibilities there and I only know that R=3 is >significantly better than R=2 and I also read that people who do checks in the >qsearch tend to prefer R=3(you do not do checks in the qsearch and I mean not to >replies to check). >> >>Who or what is Leonid? >> >>Stuart > >Leonid posted in this forum mate problems > >Uri Here is example for one of his posts. http://chessprogramming.org/cccsearch/ccc.php?art_id=339935 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.