Author: Alastair Scott
Date: 05:11:16 07/27/03
Go up one level in this thread
On July 27, 2003 at 05:56:23, Uri Blass wrote: >On July 27, 2003 at 05:20:37, Eduard Nemeth wrote: > >>Junior 8 can’t mates without TBs with B+N !!!!! > >No surprise. >A lot of programmers do not consider that knowledge as important when tablebases >can solve the problem. Or, conversely, when they are not possible the algorithm has to be coded in. (Chess Tiger for Palm, for example, can do it without tablebases and, in private correspondence, Christophe Theron told me that the algorithm was relatively straightforward). In other words ... a non-story - if there is the choice between a specialised algorithm and a lookup table to do the same job the second wins every time unless there are good reasons not to use it. (For one, the tablebase lookup can be used for a lot more than solving B+N+K vs K :) Alastair
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.