Author: Dave Gomboc
Date: 17:56:05 02/18/99
Go up one level in this thread
On February 16, 1999 at 04:45:43, Frank Schneider wrote: >I experimented a little bit with nullmove deepsearch extensions and with >singular extensions and now I have some questions: > >1. In all my tests the searchtree (#nodes to finish n iterations) increased > by a factor of 1.5 to 4. Although testresults were interesting I believe > this is too much. What are your experiences? > >2. Is it correct to assume that singular extensions work best if there are > only few other extension heuristics. > >3. How would you describe the difference between nullmove deepsearch extensions > (Donninger) and the nullmove threat detection by Deep Thought? > >4. Who uses > - singular extensions > - nullmove deepsearch extensions > - nullmove threat detection > >5. What is the best (easiest) way to implement singular extensions? > > >Thanks in advance, > >Frank Okay, I know what "null-move" is, and what "singular extensions" are. Now, what is the difference between "nullmove deepsearch extensions" and "nullmove threat detection", and which is the one that I know of as simply "null-move"? I am also interested to know if implementing both singular extensions and null-move together makes sense or not. Are they complementary? Or will they interfere with each other and degrade search quality? Dave Gomboc
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.