Author: Miguel A. Ballicora
Date: 08:26:43 05/18/01
I am toying with the possibility to include (and learn about) some sort of singular extensions in my program. I haven’t read any paper about that, just the explanations given in this forum and long time ago in r.g.c.c. Intuitively, the overhead would be huge and will hardly justify the benefits. Now, the question is, has anybody ever try to implement a limited version of singular extensions? Like, triggering the algorithm only in certain positions or circumstances? (there might be many possibilities to try, like there is an attack, evaluation is unstable, mate threats, checks etc. etc.) I just started to try and I found that my first try solved one problem much faster. (I do not have the position right now, I will post it later but it is a famous Rxf6 in Spassky-Geller candidates match of the 60’s, closed Sicilian) but it does not help in the toughest WACs and the tree is 41% bigger (average) in a set of 10 positions that I use to measure tree size (one of them is the Spassky-Geller game I mentioned). Lots of things to try and test, so far this is inconclusive and I just started. Did anybody try anything like it? Comments? Suggestions? Regards, Miguel
This page took 0.01 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.