Author: Eelco de Groot
Date: 14:01:31 09/03/00
Go up one level in this thread
Hi Leonid! I'm not sure I understand all the magical tricks you are performing with your program but it sure does sound impressive! Especially in the last bit where you find a mate between 0.5 and 1 second. I understood that as something that you maybe give the first move of the solution and your program then selectively has to find the rest of the solution. But maybe I have that wrong and you meant there that you have different versions of selective search and that one version does not solve it? I do not understand either why Rebel 10 cannot find the mate in the same time! I do not have Rebel 10 installed on this computer yet so I can not check it myself now. I do remember Ed saying that for Rebel versions older than Rebel 10c 13Mb hashtables, not more, was the optimal setting. Sometimes changing the amount of transposition tables can make a difference how fast the program finds the best move. Regards, Eelco
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.