Author: Robert Henry Durrett
Date: 06:26:17 06/08/02
Go up one level in this thread
On June 07, 2002 at 23:35:09, Eugene Nalimov wrote: >Vincent is at least partially right, and probably 100% right. TBs are useful >*before* the position arose OTB. If the program probes during the search than >it, for example, can find a winning exchange when there are still 10-12 pieces >left, or it can avoid exchanging to the position that is drawn despite programs' >advantage. > <snip> 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. Bob D.
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.