Author: Mark Young
Date: 23:07:54 08/09/98
Go up one level in this thread
On August 09, 1998 at 23:09:20, blass uri wrote: >I know DB and Cray blitz use singular extensions (when one move is clearly >better than the others they analyze it more) and I have some questions >1) how much time do the programs analyze a move to decide it is singular. >Is it a function of the total time you give the program? > >2)what is exactly a singular move >(what is the minimal difference in evaluation between the best move and the >second best move to decide that a move is singular). > >3)In what lines do the programs use singular extensions? > >4)are there other programs who use singular extensions? > I had a test position that would test if a program used singular extensions. I lost the test position but remember that CM5000 could solve the position in less then 1 sec. meaning CM5000 used singular extensions. Other programs I tested could not solve the position at all. So they did not use singular extensions. If someone has this test position please post it. >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.