Author: blass uri
Date: 20:09:20 08/09/98
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? 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.