Author: Steffen Jakob
Date: 07:08:22 08/11/03
Go up one level in this thread
On August 11, 2003 at 01:40:11, Harald Faber wrote: // ... >This is the same topic as with mating with knight+bishop. Implement or not while >the tbs solve it. >As a programmer I wouldn't waste my time implementing already solved and >available (!) knowledge. In general it´s not available everywhere, because most engines restrict the tablebase access in the search tree. E.g. they may not access the tablebase behind a certain search depth or e.g. in the qsearch. Therefore it makes sense to implement knowledge even if there are tablebases available. Greetings, Steffen.
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.