Author: Renze Steenhuisen
Date: 13:09:10 10/24/05
Go up one level in this thread
On October 24, 2005 at 15:41:28, Robert Hyatt wrote: >On October 24, 2005 at 13:38:02, Premraj Natarajan wrote: > >>I just came across a article that tells about verified Forward pruning instead >>of normal forward pruning. I am not sure if today's chess engines have >>implemented i hope developers would look into this and implement if it really >>helps. >> >>http://www.cs.biu.ac.il/~davoudo/pubs/vrfd_null.html >> >>bye >>Premraj > > >This is old. Several tried it. I don't know if anyone uses it, as it really is >an efficiency issue that slows null-move search down due to the verification >search overhead... If I recall correctly from the paper this was a minor issue, or was at least compensated for by the gain in performance (on the test set). My personal experience, however, was a major slowdown but I did not yet test it on a reasonable sized test set. Cheers Renze
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.