Author: Gian-Carlo Pascutto
Date: 13:08:05 06/08/02
Go up one level in this thread
On June 08, 2002 at 09:26:17, Robert Henry Durrett wrote: >I hope someone is not going to tell me to go study more tutorials after I ask >the following question: > >To me, a tablebase program is merely a subprogram of the chess engine. The >question is: Do the current successful engines "call" this subprogram during >the searches for "quickie" evaluations of positions occurring in the searches? >What I am thinking is that the engine user might not have any way of knowing >when such "quickie" tablebase analyses had been used. I would say yes, but 'quickie' is really the wrong word. Accessing a tablebase requires a disk read, which is much slower than a conventional evaluation, so its more like a 'slowie' :) The advantage is of course that the information in the tablebase is perfect. Most interfaces have some way of displaying when tablebases are used. -- GCP
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.