Author: Dieter Buerssner
Date: 07:53:17 10/06/01
Go up one level in this thread
On October 06, 2001 at 03:02:16, Uri Blass wrote: >Having the KPP vs KP without the KQP vs KP may cause programs trouble if they >are not designed correctly but in this case the reason for the trouble is not >only not having the KQP vs KP tablebases and the proof is that the program can >usually avoid the mistake of not going to KQP vs KP endgame without tablebases. I think, it is not even allways the problem of the engine. If I observed correctly, it can be a problem of the GUIs. GUIs can use TBs, and don't let the engines think, when this feature is enabled. Unfortunately, the GUIs are not allways clever enough, when TBs are missing, and do wrong moves. Even an engine, that is not specifically designed for the missing TBs may work very well in most cases, when it does not stop searching when it sees the first mate, or/and has some other means to avoid repetition of position/make sure, that the mate score gets better. See for example Aaron's post. I personally cannot see any convincing reason, for stopping to search from the engine's point of view, when the first mate score is seen. Regards, Dieter
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.