Computer Chess Club Archives




Subject: Singular Extensions, Nullmove deepsearch

Author: Frank Schneider

Date: 01:45:43 02/16/99

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,


This page took 0.03 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.